{'fraction_non_alphanumeric': 0.01032448377581121, 'fraction_numerical': 0.0029498525073746312, 'mean_word_length': 5.345794392523365, '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}}
Pairwise matching of 3D fragments

We propose a fractured surfaces matching algorithm for reassembling broken solids. The algorithm first use a multi-scale curvedness-based method to select feature points and remove less reliable feature points according to confidence value. Subsequently we obtain matching point pairs through measuring the similarity of local surface patches which are described by 3D histogram. After that we employ a fast and efficient hierarchical greedy algorithm to align the two fractured surfaces and judge if they are matched according to surface distance. The algorithm is also suited for arbitrary surface matching which contain rich feature points.