{'fraction_non_alphanumeric': 0.014634146341463415, 'fraction_numerical': 0.0, 'mean_word_length': 4.980582524271845, '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}}
Measure of Circularity for Digital Curves and its Fast Computation

This paper focuses on the design of an effective method that computes the measure of circularity of an open or closed digital curve. Thanks to its geometric interpretation, an algorithm that only uses classical tools of computational geometry is derived. Even if a sophisticated machinery coming from linear programming can provide a linear time algorithm, its O(n log n) time complexity is better than many quadratic methods based on Voronoi diagrams. Moreover, this bound can be improve in the case of convex digital curves to reach linear time.