{'fraction_non_alphanumeric': 0.020066889632107024, 'fraction_numerical': 0.0033444816053511705, 'mean_word_length': 4.6835443037974684, '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}}
A Distributed Model for Computing 3D Mesh Local Descriptors Based on k-Rings

In order to facilitate 3D object processing, it is common to use high-level representations. One of them is local descriptors that are usually computed using defined neighborhoods. k-rings is a technique to define them and it is widely used by several methods. In this work, we propose a model for the distributed computation of local descriptors over 3D triangular meshes, using the concept of k-rings. In our experiments, we measure the performance of our model on huge meshes, evaluating the speedup, the scalability, and the descriptor computation time. We show the optimal configuration of our model for the cluster we implemented and the linear growth of computation time regarding the size of the mesh and the number of rings. We used the Harris response for our tests which describes the saliency of the object.