{'fraction_non_alphanumeric': 0.018885741265344664, 'fraction_numerical': 0.003777148253068933, 'mean_word_length': 5.091954022988506, '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}}
Generating smooth surfaces with bicubic splines over triangular meshes: toward automatic model building from unorganized 3D points

The paper presents an algorithm for constructing tangent plane continuous (G/sup 1/) surfaces with piecewise polynomials over triangular meshes. The input mesh can be of arbitrary topological type, that is, any number of faces can meet at a mesh vertex. The mesh is first refined to one solely with quadrilateral cells. Rectangular Bezier patches are then assigned to each of the cells and control points are determined so that G/sup 1/ continuity across the patch boundaries is maintained. Since all the patches are rectangular, the resulting surface can be rendered efficiently by current commercial graphic hardware/software. In addition, by exploiting the fact that all the faces of the original mesh are triangular, the degree of each patch is optimized to three while a more general method dealing with arbitrary irregular meshes requires biquartic patches. Several surface examples generated from real 3D data are shown.