The common exterior of convex polygons in the plane

Computational Geometry: Theory and Applications

Volumn 8, Issue 3, 1997, Pages 139-149

  Aronov, Boris ^a   Sharir, Micha ^b,c  

^a POLYTECHNIC UNIVERSITY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

Arrangements; Combinatorial complexity; Common exterior; Convex polygons

Indexed keywords

EID: 0040360922     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(96)00004-1     Document Type: Article

References (19)

1. P. Alevizos, J.D. Boissonnat and F.P. Preparata, An optimal algorithm for the boundary of a cell in a union of rays, Algorithmica 5 (1990) 573-590.
2. B. Aronov, M. Bern and D. Eppstein, Arrangements of polytopes with applications, manuscript (1992).
3. B. Aronov, H. Edelsbrunner, L. Guibas and M. Sharir, Improved bounds on the number of edges of many faces in arrangements of line segments, Combinatorica 12 (1992) 261-274.
4. B. Aronov and M. Sharir, The union of convex polyhedra in three dimensions, in: Proc. 34th IEEE Symp. on Foundations of Computer Science (1993) 518-527.
5. B. Aronov, M. Sharir and B. Tagansky, The union of convex polyhedra in three dimensions, SIAM J. Comput., to appear.
6. K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir and E. Welzl, Combinatorial complexity bounds for arrangements of curves and spheres, Discrete Comput. Geom. 5 (1990) 99-160.
7. K.L. Clarkson and P.W. Shor, Applications of random sampling in computational geometry II, Discrete Comput. Geom. 4 (1989) 387-421.
8. H. Edelsbrunner, Algorithms in Combinatorial Geometry (Springer, Heidelberg, 1987).
9. H. Edelsbrunner, L. Guibas and M. Sharir, The complexity and construction of many faces in arrangements of lines and of segments, Discrete Comput. Geom. 5 (1990) 161-196.
10. H. Edelsbrunner and E. Welzl, On the maximal number of edges of many faces in arrangements, J. Comb. Theory, Ser. A 41 (1986) 159-166.
11. L. Guibas, M. Sharir and S. Sifrony, On the general motion planning problem with two degrees of freedom, Discrete Comput. Geom. 4 (1989) 491-521.
12. S. Har Peled, The complexity of many faces in the overlay of arrangements, M.Sc. Thesis, Department of Computer Sciences, Tel Aviv University (1995).
13. D.P. Huttenlocher, K. Kedem and J. Kleinberg, Voronoi diagrams of rigidly moving sets of points, Inform. Process. Lett. 43 (1992) 217-223.
14. G.O. Katona, On a problem of L. Fejes Tóth, Stud. Sci. Math. Hung. 12 (1977) 77-80.
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 Comput. Geom. 1 (1986) 59-71.
16. M.D. Kovalev, One property of convex sets and its applications, Math. Zametki 44 (1988) 89-99 (in Russian).
17. J. Matoušek, Construction of ε-nets, Discrete Comput. Geom. 5 (1990) 427-448.
18. M. Sharir and P.K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications (Cambridge University Press, New York, 1995).
19. A. Wiernik and M. Sharir, Planar realization of non-linear Davenport-Schinzel sequences by segments, Discrete Comput. Geom. 3 (1988) 15-47.