{'fraction_non_alphanumeric': 0.016129032258064516, 'fraction_numerical': 0.0, 'mean_word_length': 5.894736842105263, '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}}
A fast quadtree‐based terrain crack locating method that accounts for adjacency relationships

The repair of terrain cracks is an important process in multi‐resolution three‐dimensional terrain visualization, and rapid and accurate pinpointing of cracks between terrain blocks is of the utmost importance for this process. The existing quadtree‐based crack locating methods are generally slow and inefficient, as they require the traversal of terrain quadtrees to locate terrain cracks. In this research, we propose a fast quadtree‐based terrain crack locating method that accounts for adjacency information. First, terrain quadtrees are constructed that contain information regarding adjacency relationships. Second, dynamic updating is performed for terrain quadtrees and their adjacency information. Finally, terrain cracks are located by using the adjacencies of the quadtree nodes. This proposed method was experimentally validated via the terrain data of a mountainous region in Sichuan Province. The experimental results indicate that the proposed method can be used to efficiently and accurately locate terrain cracks with a strong performance in practical applications.