{'fraction_non_alphanumeric': 0.024096385542168676, 'fraction_numerical': 0.010327022375215147, 'mean_word_length': 5.0, '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}}
Recent Results in Computational Origami

Computational origami is a recent branch of computer science studying efficient algorithms for solving paper-folding problems. This field essentially began with Robert Lang’s work on algorithmic origami design [25], starting around 1993. Since then, the field of computational origami has grown significantly. The purpose of this paper is to survey the work in the field, with a focus on recent results, and to present several open problems that remain. The survey cannot hope to be complete, but we attempt to cover most areas of interest.