The visibility–Voronoi complex and its applications
- 2 October 2006
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 36 (1), 66-87
- https://doi.org/10.1016/j.comgeo.2005.11.007
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Shortest Paths and NetworksPublished by Taylor & Francis ,2004
- Polygon decomposition for efficient construction of Minkowski sumsComputational Geometry, 2002
- THE VISIBILITY COMPLEXInternational Journal of Computational Geometry & Applications, 1996
- Probabilistic roadmaps for path planning in high-dimensional configuration spacesIEEE Transactions on Robotics and Automation, 1996
- Finding the shortest path of a disc among polygonal obstacles using a radius-independent graphIEEE Transactions on Robotics and Automation, 1995
- An Output-Sensitive Algorithm for Computing Visibility GraphsSIAM Journal on Computing, 1991
- Moving a disc between polygonsAlgorithmica, 1991
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstaclesDiscrete & Computational Geometry, 1986
- A “retraction” method for planning the motion of a discJournal of Algorithms, 1985
- Generalization of Voronoi Diagrams in the PlaneSIAM Journal on Computing, 1981