{'fraction_non_alphanumeric': 0.006437768240343348, 'fraction_numerical': 0.0, 'mean_word_length': 4.8375, '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}}
Drawing a rectangular dual to meet prescribed constraints

The subject of the paper is to propose a heuristic method for drawing a rectangular dual so that the length and the width of the whole rectangle may be either within the prescribed size or as close to it as possible, under the condition that those of each subrectangle are no less than given lower bounds. Experimental results show that the proposed method produces sharp approximate solutions very quickly.