{'fraction_non_alphanumeric': 0.033622559652928416, 'fraction_numerical': 0.013015184381778741, 'mean_word_length': 4.732919254658385, '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}}
ACUT: Out-Of-Core Delaunay Triangulation of Large Terrain Data Sets

In the last couple of years, very detailed highresolution terrain data sets have become available thanks to new acquisition techniques, e.g., the airborne laser scanning. Such data sets contain, typically, several millions of points and, therefore, several gigabytes are required just to store them, which disallows their loading into the memory of a common computer. In this paper, we propose a novel out-of-core technique for construction of the Delaunay triangulation of such large data sets. It is based on the method of incremental insertion with flipping that is simple, robust and can be easily extended for weights of points, constraints, etc. The proposed technique was tested on various data sets with sizes up to 128M points on a commodity hardware (P4 3.2GHz, 2GB RAM, 250GB SATA disk). The largest data set was processed in about 2.5 hours.