{'fraction_non_alphanumeric': 0.020188425302826378, 'fraction_numerical': 0.0013458950201884253, 'mean_word_length': 5.305084745762712, '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}}
Voronoi diagrams in Cgal

In this paper we describe a generic C++ adaptor, that adapts a 2-dimensional triangulated Delaunay graph and to the corresponding a Voronoi diagram, represented as a doubly connected edge list (DCEL) data structure. Our adaptor has the ability to automatically eliminate, in a consistent manner, degenerate features of the Voronoi diagram, that are artifacts of the requirement that Delaunay graphs should be triangulated even in degenerate configurations. Depending on the type of operations that the underlying Delaunay graph supports, our adaptor allows for the incremental or dynamic construction of Voronoi diagrams and can support point location queries. Our code will appear in the next public release of Cgal.