dc.contributor.author | Chen, Zhonggui | en_US |
dc.contributor.author | Cao, Juan | en_US |
dc.contributor.author | Wang, Wenping | en_US |
dc.contributor.editor | C. Bregler, P. Sander, and M. Wimmer | en_US |
dc.date.accessioned | 2015-02-28T08:13:53Z | |
dc.date.available | 2015-02-28T08:13:53Z | |
dc.date.issued | 2012 | en_US |
dc.identifier.issn | 1467-8659 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1111/j.1467-8659.2012.03200.x | en_US |
dc.description.abstract | We develop a novel isotropic remeshing method based on constrained centroidal Delaunay mesh (CCDM), a generalization of centroidal patch triangulation from 2D to mesh surface. Our method starts with resampling an input mesh with a vertex distribution according to a user-defined density function. The initial remeshing result is then progressively optimized by alternatively recovering the Delaunay mesh and moving each vertex to the centroid of its 1-ring neighborhood. The key to making such simple iterations work is an efficient optimization framework that combines both local and global optimization methods. Our method is parameterization-free, thus avoiding the metric distortion introduced by parameterization, and generating more well-shaped triangles. Our method guarantees that the topology of surface is preserved without requiring geodesic information. We conduct various experiments to demonstrate the simplicity, efficacy, and robustness of the presented method. | en_US |
dc.publisher | The Eurographics Association and Blackwell Publishing Ltd. | en_US |
dc.title | Isotropic Surface Remeshing Using Constrained Centroidal Delaunay Mesh | en_US |
dc.description.seriesinformation | Computer Graphics Forum | en_US |