Generalized voronoi diagrams for moving a ladder. I: Topological analysis

DOI10.1002/CPA.3160390402MaRDI QIDQ3736451zbMATH OpenOpenAlexFDO

Authors Colm P. O'Dunlaing, Micha Sharir, Chee K. Yap

Publication date 1986

Published in Communications on Pure and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/cpa.3160390402

zbMATH Keywords

skeletonVoronoi complexgeneralized Voronoi diagrammoving a ladder

Mathematics Subject Classification ID

Polytopes and polyhedra (52Bxx) Paths and cycles (05C38) Polyhedra and polytopes; regular figures, division of spaces (51M20) Other problems of combinatorial convexity (52A37) Kinematics of a rigid body (70B10) Topological geometry (51H99)

Recommendations

• Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram
• Lower bounds on moving a ladder in two and three dimensions
• Simplified Voronoi diagrams
• A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
• An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers

Cited in

(21)

• Rods and Rings: Soft Subdivision Planner for R^3 x S^2.
• Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram
• A survey of motion planning and related geometric algorithms
• An axiomatic approach to Voronoi-diagrams in 3D
• An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
• On-line motion planning: Case of a planar rod
• Lower bounds on moving a ladder in two and three dimensions
• Coordinated motion planning for two independent robots
• On the geodesic Voronoi diagram of point sites in a simple polygon
• A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
• Hunting Voronoi vertices
• scientific article; zbMATH DE number 4074328 (Why is no real title available?)
• An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
• On soft predicates in subdivision motion planning
• On the general motion-planning problem with two degrees of freedom
• Simplified Voronoi diagrams
• Penny-packing and two-dimensional codes
• The complexity of planar compliant motion planning under uncertainty
• Mountain Climbing, Ladder Moving, and the Ring-Width of a Polygon
• A convex polygon among polygonal obstacle: Placement and high-clearance motion
• Motion planning with inertial constraints

This page was built for publication: Generalized voronoi diagrams for moving a ladder. I: Topological analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3736451)