{'fraction_non_alphanumeric': 0.017527675276752766, 'fraction_numerical': 0.0, 'mean_word_length': 5.2, '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 New Composite Method of Hole Cutting

The present paper investigates an approach that seeks to reduce the storage of the traditional hole-map method and enhance the reliability. The new composite method is based on the least hole-mapping model, which efficiently reduces the area of the hole-mapping region, and incorporates an ADT search procedure to improve the identification method of the points inside the fringe cells which would otherwise become ambiguous. Through a donor-search judgment, the identification can be accomplished efficiently even for a coarse hole-cutting model. Also a new method named ‘inverse mark’ is developed here using mesh nodes’ information to automatically identify exterior points, which are initial points to advance inside the grid region. Results have shown that the composite method is able to get rid of the restriction of high level approximation, decrease efficiently the amount of Cartesian grid and save storage memory. The present approach is of great efficiency and good reliability to complex configurations including small gap regions.