Optimal mesh algorithms for the Voronoi diagram of line segments and motion planning in the plane

DOI10.1006/JPDC.1995.1051MaRDI QIDQ1892867zbMATH OpenOpenAlexFDO

Authors Sanguthevar Rajasekaran, Suneeta Ramaswami

Publication date 6 July 1995

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://semanticscholar.org/paper/315c6b150ffd9e1f5ea2db51b86cd057e6f712fb

zbMATH Keywords

line segmentsmotion planning problemshortest pathVoronoi diagram

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)

Recommendations

• Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams
• scientific article; zbMATH DE number 176585
• A compact piecewise-linear Voronoi diagram for convex sites in the plane
• scientific article; zbMATH DE number 432985
• Shortest paths in the plane with polygonal obstacles

Cited in

(7)

• Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams
• Simplified Voronoi diagrams
• Voronoi diagrams with barriers and on polyhedra for minimal path planning
• Proximity and motion planning on \(\ell _{1}\)-rigid planar periodic graphs
• scientific article; zbMATH DE number 935096 (Why is no real title available?)
• Voronoi-based splinegon decomposition and shortest-path tree computation
• An augmented Voronoi roadmap for 3D translational motion planning for a convex polyhedron moving amidst convex polyhedral obstacles

This page was built for publication: Optimal mesh algorithms for the Voronoi diagram of line segments and motion planning in the plane

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