{'fraction_non_alphanumeric': 0.02880658436213992, 'fraction_numerical': 0.00823045267489712, 'mean_word_length': 4.939024390243903, '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}}
A new encoding scheme for rectangle packing problem

In the rectangle packing problem, encoding schemes to represent the placements of rectangles are the key factors of efficient algorithms. In 1995, an epoch-making encoding scheme, known as SEQ-PAIR, was developed. The solution space of SEQ-PAIR has been considered sufficiently small. In this paper, however, we present a simple and natural encoding scheme of rectangle packings whose solution space is smaller than that of SEQ-PAIR.