{'fraction_non_alphanumeric': 0.01854714064914992, 'fraction_numerical': 0.0, 'mean_word_length': 5.352941176470588, '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}}
Fast and memory-efficient generation of simplified meshes

Triangle meshes are used to represent surfaces in many applications due to their simplicity. Since the number of triangles often goes beyond the capabilities of computer graphics hardware, a large variety of simplified mesh construction algorithms have been proposed in the last years. But, the reconstruction processes of simplified meshes are generally time-consuming and memory inefficient. In this paper we suggest a fast and memory efficient method that produces high-quality simplified-polygonal-models. The method is based both on Marching Cubes algorithm and on Decimation method.