SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
From MaRDI portal
Publication:4889502
Recommendations
Cited in
(54)- De Casteljau's algorithm on manifolds
- Random field simulation over curved surfaces: applications to computational structural mechanics
- Efficient exact enumeration of single-source geodesics on a non-convex polyhedron
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- A survey of geodesic paths on 3D surfaces
- The Number of Shortest Paths on the Surface of a Polyhedron
- Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings
- An optimal-time algorithm for shortest paths on realistic polyhedra
- On realistic terrains
- The Discrete Geodesic Problem
- scientific article; zbMATH DE number 727953 (Why is no real title available?)
- Tracing compressed curves in triangulated surfaces
- On Shortest Paths in Polyhedral Spaces
- scientific article; zbMATH DE number 7151640 (Why is no real title available?)
- Geodesics on point clouds
- Computing generalized higher-order Voronoi diagrams on triangulated surfaces
- Shortest path on a non-convex polyhedron
- Parameter estimation for resin transfer molding.
- Shortest path algorithm for some graphs before and after folding
- Near optimal algorithm for the shortest descending path on the surface of a convex terrain
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- Shortest paths on realistic polyhedra
- Shortest Path Problems on a Polyhedral Surface
- Star unfolding of a polytope with applications
- scientific article; zbMATH DE number 140474 (Why is no real title available?)
- Shortest monotone descent path problem in polyhedral terrain
- Approximation algorithms for shortest descending paths in terrains
- scientific article; zbMATH DE number 3907791 (Why is no real title available?)
- An extended MMP algorithm: wavefront and cut-locus on a convex polyhedron
- Shortest descending paths through given faces
- Shortest path problems on a polyhedral surface
- Shortest paths in portalgons
- Shortest polygonal paths in space
- Splitting (complicated) surfaces is hard
- Shortest paths on cubes
- Finding shortest paths in a sequence of triangles in 3D by the planar unfolding
- COMPUTING SHORTEST PATHS ON POLYHEDRA: APPLICATIONS IN GEOMETRIC MODELING AND SCIENTIFIC VISUALIZATION
- Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves
- Shortest Journeys in Directed Temporal Graphs
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- The funnel tree algorithm for finding shortest paths on polyhedral surfaces
- The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains
- Fast geodesics computation with the phase flow method
- Constructing a minimum path on a polyhedral surface in R^3
- On Shortest Paths Amidst Convex Polyhedra
- Curve matching, time warping, and light fields: New algorithms for computing similarity between curves
- Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves
- Multiple shooting approach for computing approximately shortest paths on convex polytopes
- Approximate shortest paths in simple polyhedra
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- Navigating weighted regions with scattered skinny tetrahedra
- Shortest paths and convex hulls in 2D complexes with non-positive curvature
- Shortest descending paths: towards an exact algorithm
- Approximating geodesic distances on 2-manifolds in image R^3
This page was built for publication: SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4889502)
