Direct (Re)Meshing for Efficient Surface Processing

Simple item page
dc.contributor.authorSchreiner, Johnen_US
dc.contributor.authorScheidegger, Carlos E.en_US
dc.contributor.authorFleishman, Shacharen_US
dc.contributor.authorSilva, Claudio T.en_US
dc.date.accessioned2015-02-21T14:31:55Z
dc.date.available2015-02-21T14:31:55Z
dc.date.issued2006en_US
dc.description.abstractWe propose a novel surface remeshing algorithm. While many remeshing algorithms are based on global parametrization or local mesh optimization, our algorithm is closely related to surface reconstruction techniques and it requires no explicit parameterization. Our approach is based on the advancing-front paradigm, and it can be used to both incrementally remesh the complete surface, or simply to remesh a portion of it with a high-quality mesh. It is accurate, fast, robust, and suitable for use with interactive mesh processing applications that require local remeshing. We show a number of applications, including matching the resolution of meshes when doing Boolean operations such as unions and intersections. We also show how to adapt the algorithm to blend and merge mixed-mode objects - for example, to compute the union of a point-set surface and a triangle mesh.en_US
dc.description.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume25en_US
dc.identifier.doi10.1111/j.1467-8659.2006.00972.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages527-536en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2006.00972.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing, Incen_US
dc.titleDirect (Re)Meshing for Efficient Surface Processingen_US
Files
Collections
25-Issue 3