Incremental Mesh Reconstruction from Unorganized Points
Mingyong Pang · Journal of Chinese Computer Systems · 2011
Mesh reconstruction of unorganized points is one of the basic technologies in digital geometry processing.In this paper,we present a fast incremental algorithm for mesh reconstruction of unoranized points.Recurring to Kd-Tree space decomposition,searching constraint and optimum vertex estimation,our algorithm uses an initialized triangle as searching seed and gradually generated-border edges as searching elements to gradually reconstruct model surface from point clouds.The algorihm also can adaptively filter some points,which are redundant to the reconstruction,according to a user-specfied threshold.The algorithm performs well for the scattered point clouds with various density.The experimental results show that the algorithm is efficient and can work well for models with arbitrary geometric complexity.