{'fraction_non_alphanumeric': 0.014341590612777053, 'fraction_numerical': 0.01303780964797914, 'mean_word_length': 5.7368421052631575, '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}}
Overlay of Two Simple Polygons with Indeterminate Boundaries

This article outlines procedures that can be used to determine the boundaries and attributes associated with the resultant regions from the topological overlay of two simple polygons with indeterminate boundaries. After reviewing a definition of a simple polygon with indeterminate boundaries, this study first identifies the 10 resultant regions and 1,024 possible topological configurations from the overlay. Procedures for computing the boundaries of the 10 regions are discussed. Methods for determining the attributes associated with the 10 resultant regions are described. The effect of three typical overlay operations – intersection, difference, and union – on resultant regions is also discussed.