ML Anthology

Geodesic Computation for Adaptive Remeshing

Gabriel Peyré, Laurent D. Cohen
CVPR 2005 pp. 1193
doi:10.1109/CVPR.2005.169 /cvpr/2005/peyre2005cvpr-geodesic/

Abstract

This video presents an application of geodesic computation on 3D meshes to surface remeshing. The connectivity of the resulting mesh is computed using a geodesic Delaunay triangulation of the sampling points. The user can provide a speed function to conform the remeshing to various contraints such as curvature variation or texture gradient. This remeshing method is fast thanks to the use of the fast marching algorithm. It is simple to implement, robust and can serve as a basis building block for further processing of the surface such as segmentation or flattening.

CVPR Semantic Scholar

Cite

Text

Peyré and Cohen. "Geodesic Computation for Adaptive Remeshing." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2005. doi:10.1109/CVPR.2005.169

Markdown

[Peyré and Cohen. "Geodesic Computation for Adaptive Remeshing." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2005.](https://mlanthology.org/cvpr/2005/peyre2005cvpr-geodesic/) doi:10.1109/CVPR.2005.169

BibTeX

@inproceedings{peyre2005cvpr-geodesic,
  title     = {{Geodesic Computation for Adaptive Remeshing}},
  author    = {Peyré, Gabriel and Cohen, Laurent D.},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2005},
  pages     = {1193},
  doi       = {10.1109/CVPR.2005.169},
  url       = {https://mlanthology.org/cvpr/2005/peyre2005cvpr-geodesic/}
}