Surface Reconstruction based on Lower Dimensional Localized Delaunay Triangulation

Simple item page
dc.contributor.authorGopi, M.en_US
dc.contributor.authorKrishnan, S.en_US
dc.contributor.authorSilva, C.T.en_US
dc.date.accessioned2015-02-16T09:53:04Z
dc.date.available2015-02-16T09:53:04Z
dc.date.issued2000en_US
dc.description.abstractWe present a fast, memory efficient algorithm that generates a manifold triangular mesh S passing through a set of unorganized points P 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.en_US
dc.description.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume19en_US
dc.identifier.doi10.1111/1467-8659.00439en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages467-478en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.00439en_US
dc.publisherBlackwell Publishers Ltd and the Eurographics Associationen_US
dc.titleSurface Reconstruction based on Lower Dimensional Localized Delaunay Triangulationen_US
Files
Collections
Issue 3