.png){kind=icon}
.png){kind=icon}
Return
Geodesic remeshing using front propagation
.png){kind=icon}
PRE
AI
DOI：10.1007/s11263-006-6859-3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose a complete framework for 3D geometry model in g and process in 2 that uses oil I v 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.
Keywords:
remeshing
geodesic computation
fast marching algorithm
mesh segmentation
surface parameterization
texture mapping
deformable models
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.3
Papers:
3.9K
Citations:
2.8W
Organization
No organization information available