{'fraction_non_alphanumeric': 0.012738853503184714, 'fraction_numerical': 0.0, 'mean_word_length': 5.661016949152542, '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}}
Delaunay triangulation based on nesting island with holes

Islands are composed by closed arcs without intersection with each other. The relationship between islands can be either nesting or mutually independent. Through the analysis on nesting relationship among the islands, the arcs compositing islands are divided into four basal types, moreover, every type is provided an algorithm for calculation. The inner of islands is automatically identified according to the types of arc segments and then a triangulation algorithm with constrained condition was carried out. According to previous method, complex triangulations are structured. The efficiency of compiling relative programs to verify algorithm is mainly determined by the efficiency of formatting delaunay of triangulation.