Abstract: A new regiongrowing algorithm is presented for triangular mesh surface reconstruction from pointcloud data. The algorithm makes the full use of geometric and topological information inherent in the pointcloud data and adopts a series of examining rules to reconstruct triangular mesh surface rapidly. The algorithm consists of two steps： Firstly, an initial data thinning is performed to reduce the data set size. Secondly, the process of the region-growing is started from an initial triangle and is followed by choosing an appropriate point to form a satisfied triangle for each active edge in the boundary of advancing front. The triangulated region is growing repeatedly by updating boundary repeatedly. According to the relative position between the active edge and the candidate points, in presented examining rules, different thresholds are used. This avoids generating overlapping facets, selfintersection and wrong topology. The examining rules ensure the quality of reconstructed triangular mesh surface. In accordance with the problemof the advancing front broken, the overlappingedge of the opposite direction is used. This ensures to have only one boundary of advancing front throughout. Experimental results show that the algorithm has many advantages, such as high efficiency, accuracy and generality.

Key words: pointcloud data, triangular mesh surface, region growing algorithm