{'fraction_non_alphanumeric': 0.08186687069625095, 'fraction_numerical': 0.011476664116296864, 'mean_word_length': 4.169960474308301, '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 maintaining the width and diameter of a planar point-set online

Efficient online algorithms are presented for maintaining the (almost-exact) width and diameter of a dynamic planar point-set, S. Let n be the number of points currently in S, let W and D denote the width and diameter of S, respectively, and let α and Β be positive, integer-valued parameters. The algorithm for the width problem uses O(αn) space, supports updates in O(α log2n) time, and reports in O(α log2n) time an approximation, ŵ, to the width such that \(\hat W/W \leqslant \sqrt {1 + \tan ^2 \tfrac{\pi }{{4\alpha }}}\). The algorithm for the diameter problem uses O(Βn) space, supports updates in O(Βlogn) time, and reports in O(Β) time an approximation, D, to the diameter such that \(\hat D/D \geqslant \sin \left( {\tfrac{\beta }{{\beta + 1}}\tfrac{\pi }{2}} \right)\). Thus, for instance, even for α as small as 5, ŵ/W≤1.01, and for Β as small as 11, D/D≥.99. All bounds stated are worst-case. Both algorithms, but especially the one for the diameter problem, use well-understood data structures and should be simple to implement. The diameter result yields a fast implementation of the greedy heuristic for maximum-weight Euclidean matching and an efficient online algorithm to maintain approximate convex hulls in the plane.