{'fraction_non_alphanumeric': 0.011661807580174927, 'fraction_numerical': 0.0, 'mean_word_length': 5.245454545454545, '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 to locate points in a Delaunay triangulation

We present an algorithm to locate quickly the positions of several points within triangles of a given Delaunay triangulation in the plane. The proposed algorithm locates the query point simply by determining the closest node in the triangulation then by testing elements connected to that node within a small often pre-computable graph-theoretic radius (GTR). A bound on the graph-theoretic radius containing the query point is derived and its relation is characterized analytically in terms of the sharpness of the elements angles. Empirical results show that this procedure is more efficient in practice than existing algorithms