{'fraction_non_alphanumeric': 0.026194144838212634, 'fraction_numerical': 0.0015408320493066256, 'mean_word_length': 5.701030927835052, '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}}
Coarse‐to‐Fine Combinatorial Matching for Dense Isometric Shape Correspondence

We present a dense correspondence method for isometric shapes, which is accurate yet computationally efficient. We minimize the isometric distortion directly in the 3D Euclidean space, i.e., in the domain where isometry is originally defined, by using a coarse‐to‐fine sampling and combinatorial matching algorithm. Our method does not require any initialization and aims to find an accurate solution in the minimum‐distortion sense for perfectly isometric shapes. We demonstrate the performance of our method on various isometric (or nearly isometric) pairs of shapes.