Approximating geodesic distances on 2-manifolds in R^3: The weighted case
From MaRDI portal
Publication:2248735
The authors present the first algorithm for approximating weighted geodesic distances on 2-manifolds in \(\mathbb{R}^3\). The approximation error is multiplicative and depends on the density of the sample.
Recommendations
- Approximating geodesic distances on 2-manifolds in image R^3
- scientific article; zbMATH DE number 4022063
- Distance geometry in Riemannian manifolds-with-boundary
- scientific article; zbMATH DE number 1962949
- scientific article; zbMATH DE number 431672
- The length of a shortest geodesic net on a closed Riemannian manifold
- A unified framework for computing geodesic distances on nonorientable manifold polyhedral surfaces
- Geodesics on weighted projective spaces
- Lengths of geodesics between two points on a Riemannian manifold
- Weighted distance maps computation on parametric three-dimensional manifolds
Cites work
- A SIMPLE ALGORITHM FOR HOMEOMORPHIC SURFACE RECONSTRUCTION
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Approximating geodesic distances on 2-manifolds in image R^3
- Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces
- scientific article; zbMATH DE number 2119739 (Why is no real title available?)
- Surface reconstruction by Voronoi filtering
- The power crust, unions of balls, and the medial axis transform
Cited in
(2)
This page was built for publication: Approximating geodesic distances on 2-manifolds in \(\mathbb{R}^3\): The weighted case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2248735)