{'fraction_non_alphanumeric': 0.011494252873563218, 'fraction_numerical': 0.0, 'mean_word_length': 5.228571428571429, '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}}
Approximating Convex Polygons by Histogons

We study the problem of finding the largest inscribed histogon and the smallest circumscribed histogon for a convex polygon. A histogon is an axis-aligned rectilinear polygon such that every horizontal edge has an integer length. Depending on whether the horizontal width of a histogon is predetermined or not, we consider four different versions of the problem and present exact algorithms.