Abstract
We introduce a new class of fat, not necessarily convex or polygonal, objects in the plane, namely locally γ-fat objects. We prove that the union complexity of any set of n such objects is O(λ s+2(n)log 2 n). This improves the best known bound, and extends it to a more general class of objects.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Agarwal, P.K., Katz, M.J., Harir, M.: Computing depth orders for fat objects and related problems. Comput. Geom. Theory Appl. 5, 187–206 (1995)
Alt, H., Fleischer, R., Kaufmann, M., Mehlhorn, K., Näher, S., Schirra, S., Uhrig, C.: Approximate motion planning and the complexity of the boundary of the union of simple geometric figures. Algorithmica 8, 391–406 (1992)
Aronov, B., Efrat, A., Koltun, V., Sharir, M.: On the union of κ-curved objects in three and four dimensions. In: Proceedings of the 20th ACM Symposium on Computational Geometry, pp. 383–390 (2004)
de Berg, M.: Vertical ray shooting for fat objects. In: Proceedings of the 21st ACM Symposium on Computational Geometry, pp. 288–295 (2005)
de Berg, M., Gray, C.: Vertical ray shooting and computing depth orders for fat objects. In: Proceedings of the 17th ACM–SIAM Symposium on Discrete Algorithms (SODA), pp. 494–503 (2006)
de Berg, M., Katz, M., van der Stappen, F., Vleugels, J.: Realistic input models for geometric algorithms. Algorithmica 34, 81–97 (2002)
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Berlin (2000)
Efrat, A.: The complexity of the union of (α,β)-covered objects. SIAM J. Comput. 34, 775–787 (2005)
Efrat, A., Katz, M.: On the union of κ-curved objects. In: Proceedings of the 14th ACM Symposium on Computational Geometry, pp. 206–213 (1998)
Efrat, A., Rote, G., Sharir, M.: On the union of fat wedges and separating a collection of segments by a line. Comput. Geom. Theory Appl. 3, 277–288 (1993)
Efrat, A., Sharir, M.: The complexity of the union of fat objects in the plane. In: Proceedings of the 13th ACM Symposium on Computational Geometry, pp. 104–112 (1997)
Katz, M.J.: 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects. Comput. Geom. Theory Appl. 8, 299–316 (1998)
Katz, M.J., Overmars, M., Sharir, M.: Efficient output sensitive hidden surface removal for objects with small union size. Comput. Geom. Theory Appl. 2, 223–234 (1992)
Kedem, K., Livne, R., Pach, J., Sharir, M.: On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles in the plane. Discrete Comput. Geom. 1, 59–71 (1986)
Matoušek, J., Pach, J., Sharir, M., Sifrony, S., Welzl, E.: Fat triangles determine linearly many holes. SIAM J. Comput. 23, 154–169 (1994)
Pach, J., Safruti, I., Sharir, M.: The union of congruent cubes in three dimensions. Discrete Comput. Geom. 30, 133–160 (2003)
Pach, J., Tardos, G.: On the boundary complexity of the union of fat triangles. SIAM J. Comput. 31, 1745–1760 (2002)
Sharir, M., Agarwal, P.K.: Davenport–Schinzel Sequences and Their Geometric Applications. Cambridge University Press, Cambridge (1995)
van der Stappen, A.F.: Motion planning amidst fat obstacles. Ph.D. thesis, Utrecht University, Utrecht, the Netherlands (1994)
van der Stappen, A.F., Halperin, D., Overmars, M.H.: The complexity of the free space for a robot moving amidst fat obstacles. Comput. Geom. Theory Appl. 3, 353–373 (1993)
van Kreveld, M.: On fat partitioning, fat covering, and the union size of polygons. Comput. Geom. Theory Appl. 9, 197–210 (1998)
Author information
Authors and Affiliations
Corresponding author
Additional information
The research was supported by the Netherlands’ Organisation for Scientific Research (NWO) under project no. 639.023.301.
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License ( https://creativecommons.org/licenses/by-nc/2.0 ), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
de Berg, M. Improved Bounds on the Union Complexity of Fat Objects. Discrete Comput Geom 40, 127–140 (2008). https://doi.org/10.1007/s00454-007-9029-7
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-007-9029-7