The visibility-voronoi complex and its applications

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2005, Pages 63-72

  Wein, Ron ^a   Van Den Berg, Jur P ^b   Halperin, Dan ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Motion planning; Path optimization; Visibility graphs; Voronoi diagrams

Indexed keywords

ALGORITHMS; DATA STRUCTURES; GRAPH THEORY;

PATH OPTIMIZATION; VISIBILITY GRAPHS; VORONOI DIAGRAMS;

COMPUTATIONAL COMPLEXITY;

EID: 33244490793     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064092.1064104     Document Type: Conference Paper

References (22)

1. The CGAL project homepage. http://www.cgal.org/.
2. The CORE library homepage. http://www.cs.nyu.edu/exact/core/.
3. E. U. Acar, H. Choset, and P. N. Atkar. Complete sensor-baaed coverage with extended-range detectors: A hierarchical decomposition in terms of critical points and Voronoi diagrams. In Proc. IEEE/RSJ Int. Conf. Intelligent Robots and Systems, pages 1305-1311, 2001.
4. P. K. Agarwal, E. Flato, and D. Halperin. Polygon decomposition for efficient construction of Minkowski sums. Computational Geometry: Theory and Applications, 21:39-61, 2002.
5. F. Aurenhammer and R. Klein. Voronoi diagrams. In J.-R. Sack and J. Urrutia, editors. Handbook of Computational Geometry, chapter V, pages 201-290. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000.
6. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Heidelberg, Germany, 2nd edition, 2000.
7. C. A. Duncan, A. Efrat, S. G. Kobourov, and C. Wenk. Drawing with fat edges, In Proc. 9th Intern. Sympos. Graph Drawing, pages 162-177, 2001.
8. E. Fogel, R. Wein, and D. Halperin. Code flexibility and program efficiency by genericity: Improving CGAL'S arrangements. In Proc. 12th Europ. Sympos. Algorithms, pages 664-676. Springer-Verlag, 2004.
9. R. Geraerts and M. H. Overmars. Clearance based path optimization for motion planning. In IEEE Intern. Conf. Robotics and Automation, pages 2386-2392, 2004.
10. S. K. Ghosh and D. M. Mount. An output-sensitive algorithm for computing visibility graphs. SIAM Journal on Computing, 20(5):888-910, 1991.
11. S. Hirsch and E. Leiserowitz. Exact construction of Minkowski sums of polygons and a disc with application to motion planning. Technical Report ECG-TR-181205-01, Tel-Aviv University, 2002.
12. A. Kamphuis and M. H. Overmars. Finding paths for coherent groups using clearance. In R. Boulic and D. K. Pai, editors, Eurographics/ACM SIGGRAPH Sympos. Computer Animation, pages 1-10, 2004.
13. M. I. Karavelas. Segment Voronoi diagrams in CGAL, 2004. http://www.cgal.org/UserWorkshop/2004/svd.pdf.
14. L. E. Kavraki, P. Švestka, J.-C. Latombe, and M. H. Overmars, Probabilistic roadmaps for path planning in high dimensional configuration spaces. IEEE Trans. Robotics and Automation, 12:566-580, 1996.
15. K. Kedem, R. Livne, J. Pach, and M. Sharir. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete and Computational Geometry, 1:59-70, 1986.
16. D.-T. Lee and R. L. Drysdale III. Generalization of Voronoi diagrams in the plane. SIAM J. on Computing, 10(1):73-87, 1981.
17. Y. H. Liu and S. Arimoto. Finding the shortest path of a disc among polygonal obstacles using a radius-independent graph. IEEE Trans. Robotics and Automation, 11:682-691, 1995.
18. J. S. B. Mitchell. Shortest paths and networks. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 27, pages 607-642. CRC, 2nd edition, 2004.
19. D. Nieuwenhuisen and M. H. Overmars. Useful cycles in probabilistic roadmap graphs. In IEEE Intern. Conf. Robotics and Automation, pages 446-452, 2004.
20. C. Ó'Dúnlaing and C. K. Yap. A "retraction" method for planning the motion of a disk. J. Algorithms, 6:104-111, 1985.
21. M. Pocchiola and G. Vegter. The visibility complex. International J. of Computational Geometry and Applications, 6(3):279-308, 1996.
22. R. Wein. High-level filtering for arrangements of conic arcs. In Proc. 10th Europ. Sympos. Algorithms, pages 884-895. Springer-Verlag, 2002.