{'fraction_non_alphanumeric': 0.022922636103151862, 'fraction_numerical': 0.0009551098376313276, 'mean_word_length': 5.238095238095238, '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}}
On the Detection of Parallel Curves Models and Representations

In this paper, we study three parallel models for curves. Based on their common properties we develop an algorithm for the detection of parallelism among curves. Furthermore, to speed up processing, we developed theorems for fast verification at critical points. False alarm is prevented by an enhancement in tangent representation, thus no postprocessing is required. The new tangent representation is called direction-dependent tangent (DDT). It incorporates concavity information into the tangent representation and prohibits false matching. Based on the theorems and the tangent representation, we show that parallelism detection can be formulated as a correspondence problem. The algorithm handles also partial parallelism, i.e., parallelism in certain ranges along the curves but not lasting throughout the whole curves spans. By "curve" we mean any planar curve with C3 continuity. The technique treats both curves and lines alike and is valid for both open and closed curves.