Approximating geodesic distances on 2-manifolds in image \(\mathbb R^3\)

DOI10.1016/J.COMGEO.2012.05.001zbMath1321.65032OpenAlexW2108278203MaRDI QIDQ390105

Christian Scheffer, Jan Vahrenhold

Publication date: 22 January 2014

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2012.05.001

zbMATH Keywords

approximation algorithmgeodesic distancesmanifold reconstruction

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (2)

Unnamed Item ⋮ Approximating geodesic distances on 2-manifolds in \(\mathbb{R}^3\): The weighted case

Cites Work

• Unnamed Item
• Algorithms for approximate shortest path queries on weighted polyhedral surfaces
• A survey of geodesic paths on 3D surfaces
• An optimal-time algorithm for shortest paths on realistic polyhedra
• Surface reconstruction by Voronoi filtering
• Approximating geodesic distances on 2-manifolds in \(\mathbb{R}^3\): The weighted case
• Computing geodesic paths on manifolds
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
• Distance Functions and Geodesics on Submanifolds of $\R^d$ and Point Clouds
• Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces

This page was built for publication: Approximating geodesic distances on 2-manifolds in image \(\mathbb R^3\)