{'fraction_non_alphanumeric': 0.019572953736654804, 'fraction_numerical': 0.0017793594306049821, 'mean_word_length': 4.63, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Algorithm for windowing the axis-parallel rectangles

A problem arising in the 3-dim visualization of geographic maps is to select those map cells that intersect the observer’s frustum. In a trivial approach one just checks all the cells form a database for the intersection with the given frustum, which causes noticeable hang-ups of the visualization. We present a faster algorithm here. We assume that the map cells are given by their axis-parallel bounding rectangles. This way we come to the following problem for a given set S of n axis-parallel rectangles