A survey of geodesic paths on 3D surfaces
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3907791 (Why is no real title available?)
- scientific article; zbMATH DE number 1349965 (Why is no real title available?)
- scientific article; zbMATH DE number 1893557 (Why is no real title available?)
- scientific article; zbMATH DE number 1424303 (Why is no real title available?)
- A Separator Theorem for Planar Graphs
- A fast marching level set method for monotonically advancing fronts.
- A note on two problems in connexion with graphs
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- An efficient solution to the eikonal equation on parametric manifolds
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- Approximate Shortest Paths in Anisotropic Regions
- Approximate shortest path on a polyhedral surface and its applications
- Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions
- Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon
- Approximating shortest paths on a convex polytope in three dimensions
- Approximating shortest paths on a nonconvex polyhedron
- Approximating shortest paths on weighted polyhedral surfaces
- Approximation algorithms for geometric shortest path problems
- Computational geometry. Algorithms and applications.
- Computing approximate shortest paths on convex polytopes
- Computing geodesic paths on manifolds
- Constructing Approximate Shortest Path Maps in Three Dimensions
- Correction to metric entropy of some classes of sets with differentiable boundaries
- Determining approximate shortest paths on weighted polyhedral surfaces
- Distance Functions and Geodesics on Submanifolds of \R^d and Point Clouds
- Efficient Computation of Isometry‐Invariant Distances Between Surfaces
- Efficient algorithms for globally optimal trajectories
- Efficient computation of geodesic shortest paths
- Efficiently determining a locally exact shortest path on polyhedral surfaces
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Fast methods for the Eikonal and related Hamilton– Jacobi equations on unstructured meshes
- Fibonacci heaps and their uses in improved network optimization algorithms
- Lectures on partial differential equations. Transl. from the Russian by Roger Cooke
- On Shortest Paths in Polyhedral Spaces
- On finding approximate optimal paths in weighted regions
- POSTURE INVARIANT CORRESPONDENCE OF INCOMPLETE TRIANGULAR MANIFOLDS
- Path Planning in 0/1/∞ Weighted Regions with Applications
- Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\)
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
- Shortest paths on realistic polyhedra
- Storing the subdivision of a polyhedral surface
- The Discrete Geodesic Problem
- The weighted region problem
- Undirected single-source shortest paths with positive integer weights in linear time
Cited in
(18)- Efficient exact enumeration of single-source geodesics on a non-convex polyhedron
- Towards geodesic ridge curve for region-wise linear representation of geodesic distance field
- A geometric method for computation of geodesic on parametric surfaces
- Tracing compressed curves in triangulated surfaces
- Approximating generalized distance functions on weighted triangulated surfaces with applications
- Subdivision surface fitting to a dense mesh using ridges and umbilics
- scientific article; zbMATH DE number 7151640 (Why is no real title available?)
- AMRTO: Automated CAD model reconstruction of topology optimization result
- Computing the Riemannian center of mass on meshes
- An (n^d) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures
- An extended MMP algorithm: wavefront and cut-locus on a convex polyhedron
- scientific article; zbMATH DE number 7669905 (Why is no real title available?)
- Geodetic polynomials of n-Sunlet and triangular snake TS_n graphs
- A note on the unsolvability of the weighted region shortest path problem
- A unified framework for computing geodesic distances on nonorientable manifold polyhedral surfaces
- Pseudo-geodesics on three-dimensional surfaces and pseudo-geodesic meshes
- Analysis of farthest point sampling for approximating geodesics in a graph
- Approximating geodesic distances on 2-manifolds in image R^3
This page was built for publication: A survey of geodesic paths on 3D surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654287)
