{'fraction_non_alphanumeric': 0.030303030303030304, 'fraction_numerical': 0.024793388429752067, 'mean_word_length': 4.126760563380282, '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}}
Packing Random Rectangles of Given Volume

A packing of a collection of rectangles is a disjoint subcollection. In a recent paper, Coffman et al. (1999) prove that the cardinality of a maximum packing of a family ofn random rectangles in [0, 1] 2 is of order n 1/2. We obtain tight bounds on the same quantity when the random rectangles are of a specified volume.