{'fraction_non_alphanumeric': 0.01676829268292683, 'fraction_numerical': 0.001524390243902439, 'mean_word_length': 5.140186915887851, '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}}
Multi-way Geometry Encoding

The problem of representing a 3D model in a more compact manner was extensively studied. While much attention has been paid to the compression of the connectivity, compressing the geometry remains challenging. We introduce a novel geometry-encoding algorithm, which is based on traversing the vertices in an order that improves the performance of the geometry prediction. We analyze the prediction scheme and show how a multi-directional prediction can improve the encoding of the geometry. We suggest an approximated multi-directional prediction and show that it leads to the best geometry compression ratios published so far.