Approximating geodesic distances on 2-manifolds in image R^3
The geodesic distance between two points \(p\) and \(q\) of a connected set \(X\) is the length of the shortest path(s) linking this two points. In general, the geodesic distance is denoted by \(d_{X}(p,q)\). In this paper, the authors present an algorithm which approximates geodesic distances between points sampled from a 2 manifold in \(\mathbb{R}^{3}\) such that the approximation error is multiplicative. They use technics from computational geometry such as the Delaunay tetrahedrization and also they use Schreiber's optimal algorithm to compute exact geodesic distances. The paper contains important results and can be considered as a linking bridge between Riemannian geometry and computational geometry.
- Approximation algorithms for geometrical distance problems that are not solvable exactly
- Computing geodesic paths on manifolds
- Distance Functions and Geodesics on Submanifolds of \R^d and Point Clouds
- Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions
- Geodesic methods in computer vision and graphics
- A survey of geodesic paths on 3D surfaces
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- An optimal-time algorithm for shortest paths on realistic polyhedra
- Approximating geodesic distances on 2-manifolds in \(\mathbb{R}^3\): The weighted case
- Computing geodesic paths on manifolds
- Distance Functions and Geodesics on Submanifolds of \R^d and Point Clouds
- Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces
- scientific article; zbMATH DE number 2119739 (Why is no real title available?)
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
- Surface reconstruction by Voronoi filtering
- Geodesics on point clouds
- Approximating geodesic distances on 2-manifolds in \(\mathbb{R}^3\): The weighted case
- Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces
- Geodesic methods in computer vision and graphics
- Computing geodesic paths on manifolds
- A unified framework for computing geodesic distances on nonorientable manifold polyhedral surfaces
- Distance Functions and Geodesics on Submanifolds of \R^d and Point Clouds
- scientific article; zbMATH DE number 7669905 (Why is no real title available?)
- Towards geodesic ridge curve for region-wise linear representation of geodesic distance field
This page was built for publication: Approximating geodesic distances on 2-manifolds in image \(\mathbb R^3\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q390105)
