Polygonizing Non-Uniformly Distributed 3D Points by Advancing Mesh Frontiers

30 digitization devices produce very large sets of 3 0 points sampled from the suqaces of the objects being scanned. A mesh construction procedure needs to be:upplied to derive polygon mesh from the 30 point sets\ As ts derived from..digitization devices based on in8 technologies are inhsaenrly distributed over regions that may contain surface discontinuities, existing methods are not suitable ,for polygonizing them. This paper describes a novel polygonization algorithm,for constructing triangle meshfrom unorganized 3D points. In contrast to existing methods, this a1gorith.mbegins the mesh construction processsrom 3 0 points lying on smooth suqaces, and advances the mesh frontier towards 30 points lying near surjGace discontinuities. If 30 points along the edges and at the corners are sampled, then the algorithm will form an edge where two advancing frontiers meet, and a corner where three or niore.frontiers meet. Otherwise, the algorithm constructs approximations of the edges and cor...

• Type: Conference
• Year: 2001
• Where: CGI
• Authors: Indriyati Atmosukarto, Luping Zhou, Wee Kheng Leow, Zhiyong Huang
• Keywords: CGI 2001, Computer Graphics, Mesh Construction, Mesh Construction Procedure, Unorganized 3D Points