The visibility-Voronoi complex and its applications

DOI10.1016/j.comgeo.2005.11.007zbMath1110.65021OpenAlexW2218021848MaRDI QIDQ870429

Dan Halperin, Jur P. van den Berg, Ron Wein

Publication date: 12 March 2007

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2005.11.007

zbMATH Keywords

algorithmvisibility graphsoftware packagegraphical examplesrobotpolygonal obstaclesDijkstra searchplanning natural-looking pathsvisibility-Voronoi diagram

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Robot dynamics and control of rigid bodies (70E60) Packaged methods for numerical algorithms (65Y15)

Related Items

Edge routing with ordered bundles, Advanced programming techniques applied to CGAL's arrangement package, Some indecomposable polyhedra

Uses Software

• CGAL
• 2D Arrangement
• Voronoi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Moving a disc between polygons
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Piecewise linear paths among convex obstacles
• Advanced programming techniques applied to CGAL's arrangement package
• A “retraction” method for planning the motion of a disc
• Generalization of Voronoi Diagrams in the Plane
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• The visibility--voronoi complex and its applications
• Algorithms – ESA 2004
• THE VISIBILITY COMPLEX
• Polygon decomposition for efficient construction of Minkowski sums