Voronoi diagrams with barriers and on polyhedra for minimal path planning
From MaRDI portal
Publication:1822055
DOI10.1007/BF01898357zbMath0617.51018OpenAlexW1996547210MaRDI QIDQ1822055
Colin Verrilli, Varol Akman, William Randolph Franklin
Publication date: 1985
Published in: The Visual Computer (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01898357
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Polyhedra and polytopes; regular figures, division of spaces (51M20) Polytopes and polyhedra (52Bxx)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- Voronoi diagrams from convex hulls
- On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
- On the piano movers' problem: V. The case of a rod moving in three-dimensional space amidst polyhedral obstacles
- Euclidean shortest paths in the presence of rectilinear barriers
- Spatial Planning: A Configuration Space Approach
- Dynamic Voronoi diagrams
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- On the Piano Movers' problem: IV. Various decomposable two-dimensional motion-planning problems
- On Shortest Paths in Polyhedral Spaces
- The Complexity of Enumeration and Reliability Problems
- A Separator Theorem for Planar Graphs
- Generalization of Voronoi Diagrams in the Plane
- Applications of a Planar Separator Theorem
- A linear algorithm for computing the visibility polygon from a point
- An efficient algorithm for K shortest simple paths
- Optimal Search in Planar Subdivisions
- A parametric algorithm for drawing pictures of solid objects composed of quadric surfaces
- Location of a Point in a Planar Subdivision and Its Applications
- Interpolation search—a log log N search
- Finding the K Shortest Loopless Paths in a Network
This page was built for publication: Voronoi diagrams with barriers and on polyhedra for minimal path planning