Premium
Surface Reconstruction based on Lower Dimensional Localized Delaunay Triangulation
Author(s) -
Gopi M.,
Krishnan S.,
Silva C.T.
Publication year - 2000
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/1467-8659.00439
Subject(s) - delaunay triangulation , bowyer–watson algorithm , surface reconstruction , computer science , surface triangulation , constrained delaunay triangulation , pitteway triangulation , computer graphics (images) , surface (topology) , triangulation , computer vision , artificial intelligence , point set triangulation , geometry , algorithm , mathematics
We present a fast, memory efficient algorithm that generates a manifold triangular mesh S passing through a set of unorganized pointsP R 3 . Nothing is assumed about the geometry, topology or presence of boundaries in the data set except that P is sampled from a real manifold surface. The speed of our algorithm is derived from a projection‐based approach we use to determine the incident faces on a point. We define our sampling criteria to sample the surface and guarantee a topologically correct mesh after surface reconstruction for such a sampled surface. We also present a new algorithm to find the normal at a vertex, when the surface is sampled according our given criteria. We also present results of our surface reconstruction using our algorithm on unorganized point clouds of various models.