{'fraction_non_alphanumeric': 0.016113744075829384, 'fraction_numerical': 0.002843601895734597, 'mean_word_length': 4.770491803278689, '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}}
On the development of a hole filling algorithm for triangular meshes

Abstract Hole‐filling is a process to repair the holes in a triangular model and to keep the topology accurate and preserve the smoothness of the original surface as new meshes are added. We propose a hole‐filling algorithm by fitting the vertices in the vicinity of a hole into a B‐spline surface and plan new vertices on the u‐v domain corresponding to such a surface. The main advantage of such a method is that the u‐v plane, instead of a 3D plane conventionally used, can better be used for the planning of new vertices distributed appropriately on the hole, especially for curved holes with steep slopes. The points on the u‐v plane are mapped onto the B‐spline surface to yield 3D vertices. Since the surface does not pass through the boundary vertices of the hole completely, a modification algorithm based on the local moving least squares method is proposed to modify the 3D vertices. Successful examples are presented to illustrate the feasibility of the proposed algorithm.