{'fraction_non_alphanumeric': 0.021164021164021163, 'fraction_numerical': 0.0, 'mean_word_length': 5.755102040816326, '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}}
An Intelligent Method of Detecting Multi-factors Neighborhood Relation Based On Constrained Delaunay Triangulation

Spatial neighborhood relation detecting is the basis of organization, query, analysis and reasoning of spatial data. For the spatial neighborhood relations of the geographic entities are contained in the Delaunay triangulation, in this paper, the spatial neighborhood relations between multi-factors (including points, lines and polygons) are intelligently detected based on the Constrained Delaunay Triangulation (CDT). This approach consists of steps listed below: A matched candidate points index is set up in order to reorganize the related data of multi-factors. Then the CDT, which is constrained by edges of lines and polygons, is established with the source of coordinates in point index. After coding the CDT according to a rule this paper proposing, neighborhood relation of geographic entities can be searched automatically. And a global neighborhood relation (including separation and neighbor relation) among multi-factors is automatically established by spatial reasoning. This intelligent method of spatial neighborhood relation detecting, which is no need for manual intervention and not limited between two kinds of geographic entities, has high precision and great feasibility in practice.