Constructing Approximate Shortest Path Maps in Three Dimensions
From MaRDI portal
(Redirected from Publication:4268702)
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Three-dimensional polytopes (52B10) Numerical approximation and computational geometry (primarily algorithms) (65D99) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Recommendations
- Approximate Euclidean Shortest Paths in 3-Space
- Approximating shortest paths on a convex polytope in three dimensions
- An algorithm for shortest-path motion in three dimensions
- An approximation algorithm for computing shortest paths in weighted 3-d domains
- New results on shortest paths in three dimensions
- scientific article; zbMATH DE number 4064475
- Approximate shortest paths in simple polyhedra
- An Efficient Algorithm for Shortest Path in Three Dimensions With Polyhedral Obstacles
- Three-dimensional Euclidean distance transformation and its application to shortest path planning
- Efficiently approximating polygonal paths in three and higher dimensions
Cited in
(19)- Pseudo approximation algorithms with applications to optimal motion planning
- Three-dimensional Euclidean distance transformation and its application to shortest path planning
- Optimal pathway reconstruction on 3D NMR maps
- Flying over a polyhedral terrain
- An approximation algorithm for computing shortest paths in weighted 3-d domains
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- A GENERAL APPROXIMATION ALGORITHM FOR PLANAR MAPS WITH APPLICATIONS
- Querying approximate shortest paths in anisotropic regions
- Approximate Euclidean Shortest Paths in 3-Space
- Approximate shortest distances among smooth obstacles in 3D
- Approximate shortest distances among smooth obstacles in 3D
- Navigating weighted regions with scattered skinny tetrahedra
- Approximating Minimization Diagrams and Generalized Proximity Search
- 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
- A survey of geodesic paths on 3D surfaces
- Realizing metric spaces with convex obstacles
- An optimal-time algorithm for shortest paths on realistic polyhedra
- Approximation algorithms for shortest descending paths in terrains
This page was built for publication: Constructing Approximate Shortest Path Maps in Three Dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4268702)
