Minimal tangent visibility graphs

Computational Geometry: Theory and Applications

Volumn 6, Issue 5, 1996, Pages 303-314

  Pocchiola, Michel ^a   Vegter, Gert ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

Convex hulls; Davenport Schinzel sequences; Maps; Plane trees; Pseudo triangulations; Pseudotriangles; Relative convex hulls; Triangulations; Visibility graphs

Indexed keywords

EID: 0001698528     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-7721(95)00016-X     Document Type: Article

References (22)

1. T. Asano, T. Asano, L. Guibas, J. Hershberger and H. Imai, Visibility of disjoint polygons, Algorithmica 1 (1986) 49-63.
2. D. Campbell and J. Higgins, Minimal visibility graphs, Inform. Process. Lett. 37 (1991) 49-53.
3. R. Cori, Un code pour les graphes planaires et ses applications, Astérisque 27 (Société Mathématique de France, 1975).
4. H. Edelsbrunner and L.J. Guibas, Topologically sweeping an arrangement, J. Comput. System Sci. 38 (1989) 165-194.
5. S.K. Ghosh and D. Mount, An output sensitive algorithm for computing visibility graphs, SIAM J. Comput. 20 (1991) 888-910.
6. J.E. Goodman and R. Pollack, Allowable Sequences and Order Types in Discrete and Computational Geometry, Vol. 10 of Algorithms and Combinatorics, Chapter V (Springer, Berlin, 1993).
7. B. Grünbaum and G.C. Shephard, Rotation and winding numbers for polygons and curves, Trans. Amer. Math. Soc. 322 (1) (1990) 169-187.
8. 2) time, Bull. EATCS 26 (1985) 13-20.
9. G.A. Jones and D. Singerman, Theory of maps on orientable surfaces, Proc. London Math. Soc. 37 (3) (1978) 273-307.
10. S. Kapoor and S.N. Maheswari, Efficient algorithms for euclidean shortest paths and visibility problems with polygonal obstacles, in: Proc. 4th Annu. ACM Sympos. Comput. Geometry (1988) 178-182.
11. T. Lozano-Pérez and M.A. Wesley, An algorithm for planning collision-free paths among polyhedral obstacles, Commun. ACM 22 (10) (1979) 560-570.
12. J. O'Rourke, Computational geometry column 18, Internat. J. Comput. Geom. Appl. 3 (1) (1993) 107-113.
13. M.H. Overmars and E. Welzl, New methods for computing visibility graphs, in: Proceedings of the 4th Annual ACM Sympos. Comput. Geometry (1988) 164-171.
14. M. Pocchiola and G. Vegter, The visibility complex, in: Proc. 9th Annu. ACM Sympos. Comput. Geom. (May 1993) 328-337.
15. M. Pocchiola and G. Vegter, Order types and visibility types of configurations of disjoint convex plane sets (extented abstract), Technical Report 94-4, Labo. d'Inf. de l'Ens (January 1994).
16. M. Pocchiola and G. Vegter, Computing visibility graphs via pseudo-triangulations, in: Proc. of the 11th Ann. ACM Sympos. Comput. Geometry (June 1995) 248-257.
17. H. Rohnert, Shortest paths in the plane with convex polygonal obstacles, Inform. Process. Lett. 23 (1986) 71-76.
18. H. Rohnert, Time and space efficient algorithms for shortest paths between convex polygons, Inform. Process. Lett. 27 (1988) 175-179.
19. X. Shen and H. Edelsbrunner, A tight lower bound on the size of visibility graphs, Inform. Process. Lett. 26 (1987/88) 61-64.
20. X. Shen and Q. Hu, A note on minimal visibility graphs, Inform. Process. Lett. 46 (1993) 101.
21. S. Sudarshan and C.P. Rangan, A fast algorithm for computing sparse visibility graphs, Algorithmica 5 (1990) 201-214.
22. E. Welzl, Constructing the visibility graph of n line segments in the plane, Inform. Process. Lett. 20 (1985) 167-171.