An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
From MaRDI portal
Publication:2482203
Recommendations
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- Approximating shortest paths on a convex polytope in three dimensions
- An optimal-time algorithm for shortest paths on realistic polyhedra
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
- Publication:4886077
Cites work
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 1436136 (Why is no real title available?)
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
- Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions
- Approximating shortest paths on a convex polytope in three dimensions
- Approximating shortest paths on weighted polyhedral surfaces
- Constructing Approximate Shortest Path Maps in Three Dimensions
- Edge-unfolding nested polyhedral bands
- Efficient computation of geodesic shortest paths
- Fundamentals of Computation Theory
- Geometric folding algorithms. Linkages, origami, polyhedra
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Nonoverlap of the star unfolding
- On Shortest Paths Amidst Convex Polyhedra
- On Shortest Paths in Polyhedral Spaces
- Optimal Point Location in a Monotone Subdivision
- Optimal Search in Planar Subdivisions
- 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
- Star Unfolding of a Polytope with Applications
- Storing the subdivision of a polyhedral surface
- The Discrete Geodesic Problem
- Two-Dimensional and Three-Dimensional Point Location in Rectangular Subdivisions
Cited in
(17)- Shortest path problems on a polyhedral surface
- The funnel tree algorithm for finding shortest paths on polyhedral surfaces
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- Shortest paths on realistic polyhedra
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- Star unfolding convex polyhedra via quasigeodesic loops
- An improved algorithm for the shortest descending path on a convex terrain
- Navigating weighted regions with scattered skinny tetrahedra
- Tracing compressed curves in triangulated surfaces
- Voronoi game on polygons
- A survey of geodesic paths on 3D surfaces
- Time and space efficient algorithms for shortest paths between convex polygons
- Shortest Path Problems on a Polyhedral Surface
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- Near optimal algorithm for the shortest descending path on the surface of a convex terrain
- Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces
- An optimal-time algorithm for shortest paths on realistic polyhedra
This page was built for publication: An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482203)
