A survey of geodesic paths on 3D surfaces
From MaRDI portal
Publication:654287
DOI10.1016/j.comgeo.2011.05.006zbMath1231.65038OpenAlexW1561451935MaRDI QIDQ654287
Anil Maheshwari, Stefanie Wuhrer, Prosenjit Bose, Chang Shu
Publication date: 28 December 2011
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2011.05.006
Related Items (12)
Subdivision surface fitting to a dense mesh using ridges and umbilics ⋮ A geometric method for computation of geodesic on parametric surfaces ⋮ An \(\Omega (n^d)\) lower bound on the number of cell crossings for weighted shortest paths in \(d\)-dimensional polyhedral structures ⋮ Unnamed Item ⋮ Approximating geodesic distances on 2-manifolds in image \(\mathbb R^3\) ⋮ An Extended MMP Algorithm: Wavefront and Cut-Locus on a Convex Polyhedron ⋮ Computing the Riemannian center of mass on meshes ⋮ Approximating generalized distance functions on weighted triangulated surfaces with applications ⋮ Unnamed Item ⋮ Analysis of farthest point sampling for approximating geodesics in a graph ⋮ A note on the unsolvability of the weighted region shortest path problem ⋮ Tracing compressed curves in triangulated surfaces
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- Approximate shortest path on a polyhedral surface and its applications
- Efficiently determining a locally exact shortest path on polyhedral surfaces
- Correction to metric entropy of some classes of sets with differentiable boundaries
- Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions
- Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\)
- Lectures on partial differential equations. Transl. from the Russian by Roger Cooke
- Computing approximate shortest paths on convex polytopes
- Storing the subdivision of a polyhedral surface
- An efficient solution to the eikonal equation on parametric manifolds
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- Approximating Shortest Paths on a Nonconvex Polyhedron
- Efficient computation of geodesic shortest paths
- The Discrete Geodesic Problem
- Undirected single-source shortest paths with positive integer weights in linear time
- Approximation algorithms for geometric shortest path problems
- Determining approximate shortest paths on weighted polyhedral surfaces
- Efficient Computation of Isometry‐Invariant Distances Between Surfaces
- POSTURE INVARIANT CORRESPONDENCE OF INCOMPLETE TRIANGULAR MANIFOLDS
- Shortest paths on realistic polyhedra
- Approximate Shortest Paths in Anisotropic Regions
- On Shortest Paths in Polyhedral Spaces
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Computing geodesic paths on manifolds
- A Separator Theorem for Planar Graphs
- Path Planning in 0/1/∞ Weighted Regions with Applications
- Constructing Approximate Shortest Path Maps in Three Dimensions
- The weighted region problem
- Approximating shortest paths on a convex polytope in three dimensions
- Fast methods for the Eikonal and related Hamilton– Jacobi equations on unstructured meshes
- Efficient algorithms for globally optimal trajectories
- A fast marching level set method for monotonically advancing fronts.
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
- Fibonacci heaps and their uses in improved network optimization algorithms
- Distance Functions and Geodesics on Submanifolds of $\R^d$ and Point Clouds
- On finding approximate optimal paths in weighted regions
- Approximating shortest paths on weighted polyhedral surfaces
This page was built for publication: A survey of geodesic paths on 3D surfaces
