Improved bounds on the union complexity of fat objects

Discrete and Computational Geometry

Volumn 40, Issue 1, 2008, Pages 127-140

  De Berg, Mark ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Density Lemma; Fat Objects; Union Complexity

Indexed keywords

EID: 49249132575     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-007-9029-7     Document Type: Article

References (21)

1. P.K. Agarwal M.J. Katz M. Harir 1995 Computing depth orders for fat objects and related problems Comput. Geom. Theory Appl. 5 187 206
2. H. Alt R. Fleischer M. Kaufmann K. Mehlhorn S. Näher S. Schirra C. Uhrig 1992 Approximate motion planning and the complexity of the boundary of the union of simple geometric figures Algorithmica 8 391 406
3. 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)
4. de Berg, M.: Vertical ray shooting for fat objects. In: Proceedings of the 21st ACM Symposium on Computational Geometry, pp. 288-295 (2005)
5. 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)
6. M. de Berg M. Katz F. van der Stappen J. Vleugels 2002 Realistic input models for geometric algorithms Algorithmica 34 81 97
7. de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Berlin (2000)
8. A. Efrat 2005 The complexity of the union of (α,β)-covered objects SIAM J. Comput. 34 775 787
9. Efrat, A., Katz, M.: On the union of κ-curved objects. In: Proceedings of the 14th ACM Symposium on Computational Geometry, pp. 206-213 (1998)
10. A. Efrat G. Rote M. Sharir 1993 On the union of fat wedges and separating a collection of segments by a line Comput. Geom. Theory Appl. 3 277 288
11. 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)
12. M.J. Katz 1998 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
13. M.J. Katz M. Overmars M. Sharir 1992 Efficient output sensitive hidden surface removal for objects with small union size Comput. Geom. Theory Appl. 2 223 234
14. K. Kedem R. Livne J. Pach M. Sharir 1986 On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles in the plane Discrete Comput. Geom. 1 59 71
15. J. Matoušek J. Pach M. Sharir S. Sifrony E. Welzl 1994 Fat triangles determine linearly many holes SIAM J. Comput. 23 154 169
16. J. Pach I. Safruti M. Sharir 2003 The union of congruent cubes in three dimensions Discrete Comput. Geom. 30 133 160
17. J. Pach G. Tardos 2002 On the boundary complexity of the union of fat triangles SIAM J. Comput. 31 1745 1760
18. Sharir, M., Agarwal, P.K.: Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, Cambridge (1995)
19. van der Stappen, A.F.: Motion planning amidst fat obstacles. Ph.D. thesis, Utrecht University, Utrecht, the Netherlands (1994)
20. A.F. van der Stappen D. Halperin M.H. Overmars 1993 The complexity of the free space for a robot moving amidst fat obstacles Comput. Geom. Theory Appl. 3 353 373
21. M. van Kreveld 1998 On fat partitioning, fat covering, and the union size of polygons Comput. Geom. Theory Appl. 9 197 210