Author： Peyré Gabriel Cohen Laurent
Publisher： Springer Publishing Company
ISSN： 0920-5691
Source： International Journal of Computer Vision, Vol.69, Iss.1, 2006-08, pp. : 145-156
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
In this paper, we propose a complete framework for 3D geometry modeling and processing that uses only fast geodesic computations. The basic building block for these techniques is a novel greedy algorithm to perform a uniform or adaptive remeshing of a triangulated surface. Our other contributions include a parameterization scheme based on barycentric coordinates, an intrinsic algorithm for computing geodesic centroidal tessellations, and a fast and robust method to flatten a genus-0 surface patch. On large meshes (more than 500,000 vertices), our techniques speed up computation by over one order of magnitude in comparison to classical remeshing and parameterization methods. Our methods are easy to implement and do not need multilevel solvers to handle complex models that may contain poorly shaped triangles.
Related content
Road centreline extraction from classified images by using the geodesic method
Remote Sensing Letters, Vol. 5, Iss. 4, 2014-04 ,pp. :
Access to resources
Recommend
Surface remeshing in arbitrary codimensions
The Visual Computer, Vol. 22, Iss. 9-11, 2006-09 ,pp. :
Polygonal surface remeshing with Delaunay refinement
Engineering with Computers, Vol. 26, Iss. 3, 2010-06 ,pp. :