Abstract
Let \(\mathcal{C}\) be a collection of n compact convex sets in the plane such that the boundaries of any pair of sets in \(\mathcal{C}\) intersect in at most s points for some constant s≥4. We show that the maximum number of regular vertices (intersection points of two boundaries that intersect twice) on the boundary of the union U of \(\mathcal{C}\) is O *(n 4/3), which improves earlier bounds due to Aronov et al. (Discrete Comput. Geom. 25, 203–220, 2001). The bound is nearly tight in the worst case. In this paper, a bound of the form O *(f(n)) means that the actual bound is C ε f(n)⋅n ε for any ε>0, where C ε is a constant that depends on ε (and generally tends to ∞ as ε decreases to 0).
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Agarwal, P.K.: Intersection and Decomposition Algorithms for Planar Arrangements. Cambridge University Press, New York (1991)
Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry. Contemporary Mathematics, vol. 223, pp. 1–56. Am. Math. Soc., Providence (1999)
Agarwal, P.K., Sharir, M.: Pseudo-line arrangements: Duality, algorithms, and applications. SIAM J. Comput. 34(3), 526–552 (2005)
Agarwal, P.K., de Berg, M., Halperin, D., Sharir, M.: Efficient generation of k-directional assembly sequences. In: Proc. 7th ACM-SIAM Sympos. Discrete Algo, pp. 122–131 (1996)
Aronov, B., Efrat, A., Halperin, D., Sharir, M.: On the number of regular vertices of the union of Jordan regions. Discrete Comput. Geom. 25, 203–220 (2001)
Chazelle, B., Friedman, J.: A deterministic view of random sampling and its use in geometry. Combinatorica 10(3), 229–249 (1990)
Edelsbrunner, H.: Algorithms in Combinatorial Geometry. Springer, Heidelberg (1987)
Ezra, E.: Geometric arrangements: Substructures and algorithms. Ph.D. thesis, Computer Science Department, Tel-Aviv University, Tel-Aviv (August 2007). http://www.math.tau.ac.il/~estere
Ezra, E., Sharir, M.: Counting and representing intersections among triangles in three dimensions. Comput. Geom. Theory Appl. 32(3), 196–215 (2005)
Katz, M.J., Sharir, M.: An expander-based approach to geometric optimization. SIAM J. Comput. 26, 1384–1408 (1997)
Kedem, K., Livne, R., Pach, J., Sharir, M.: On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete Comput. Geom. 1, 59–71 (1986)
Matoušek, J.: Cutting hyperplane arrangements. Discrete Comput. Geom. 6, 385–406 (1991)
Matoušek, J.: Geometric range searching. ACM Comput. Surv. 26(4), 421–461 (1994)
Pach, J., Sharir, M.: On the boundary of the union of planar convex sets. Discrete Comput. Geom. 21, 321–328 (1999)
Pach, J., Sharir, M.: Geometric incidences. In: Pach, J. (ed.) Towards a Theory of Geometric Graphs. Contemporary Mathematics, vol. 342, pp. 185–223. Am. Math. Soc., Providence (2004)
Sharir, M., Agarwal, P.K.: Davenport–Schinzel Sequences and Their Geometric Applications. Cambridge University Press, Cambridge (1995)
Author information
Authors and Affiliations
Corresponding author
Additional information
Work by János Pach and Micha Sharir was supported by NSF Grant CCF-05-14079, and by a grant from the U.S.–Israeli Binational Science Foundation. Work by Esther Ezra and Micha Sharir was supported by grant 155/05 from the Israel Science Fund and by the Hermann Minkowski–MINERVA Center for Geometry at Tel Aviv University. Work on this paper by the first author has also been supported by an IBM Doctoral Fellowship. A preliminary version of this paper has been presented in Proc. 23nd Annu. ACM Sympos. Comput. Geom., 2007, pp. 220–226.
E. Ezra’s current address: Department of Computer Science, Duke University, Durham, NC 27708-0129, USA. E-mail: esther@cs.duke.edu
Rights and permissions
About this article
Cite this article
Ezra, E., Pach, J. & Sharir, M. On Regular Vertices of the Union of Planar Convex Objects. Discrete Comput Geom 41, 216–231 (2009). https://doi.org/10.1007/s00454-008-9118-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-008-9118-2