{'fraction_non_alphanumeric': 0.022222222222222223, 'fraction_numerical': 0.012345679012345678, 'mean_word_length': 5.151515151515151, '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}}
Shape partitioning by convexity

The partitioning of two dimensional (2-D) shapes into subparts is an important component of shape analysis. The paper defines a formulation of convexity as a criterion of good part decomposition. Its appropriateness is validated by applying it to some simple shapes as well as against showing its close correspondence with Hoffman and Singh's (1997) part saliency factors.