On the union of κ-curved objects

Computational Geometry: Theory and Applications

Volumn 14, Issue 4, 1999, Pages 241-254

  Efrata, Alon ^a   Katz, Matthew J ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Combinatorial complexity; Davenport Schinzel sequences; Fat objects; Union of objects

Indexed keywords

EID: 0012637864     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0925-7721(99)00036-x     Document Type: Article

References (17)

1. P.K. Agarwal, M.J. Katz, M. Sharir, Computing depth orders for fat objects and related problems, Computational Geometry 5 (1995) 187-206.
2. H. Alt, R. Fleischer, M. Kaufmann, K. Mehlhorn, S. Näher, S. Schirra, C. Uhrig, Approximate motion planning and the complexity of the boundary of the union of simple geometric figures, Algorithmica 8 (1992) 391-406.
3. M. de Berg, Linear size binary space partitions for fat objects, in: Proc. 3rd Annu. European Symp. Algorithms, 1995, pp. 252-263. (See also Technical Report UU-CS-1998-12, Department of Computer Science, Utrecht University, 1998.)
4. B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, Algorithms for bichromatic line segment problems and polyhedral terrains, Algorithmica 11 (1994) 116-132.
5. A. Efrat, M.J. Katz, F. Nielsen, M. Sharir, Dynamic data structures for fat objects and their applications, in: Proc. 5th Workshop Algorithms and Data Structures, 1997, pp. 297-306.
6. A. Efrat, G. Rote, M. Sharir, On the union of fat wedges and separating a collection of segments by a line, Computational Geometry 3 (1993) 277-288.
7. A. Efrat, M. Sharir, On the complexity of the union of fat objects in the plane, in: Proc. 13th ACM Symp. on Computational Geometry, 1997, pp. 104-112.
8. M.J. Katz, 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects, Computational Geometry 8 (1997) 299-316.
9. M.J. Katz, M.H. Overmars, M. Sharir, Efficient hidden surface removal for objects with small union size, Computational Geometry 2 (1992) 223-234.
10. J. Matoušek, J. Pach, M. Sharir, S. Sifrony, E. Welzl, Fat triangles determine linearly many holes, SIAM J. Comput. 23 (1994) 154-169.
11. M.H. Overmars, A.F. van der Stappen, Range searching and point location among fat objects, J. Algorithms 21 (1996) 629-656.
12. M. Sharir, P.K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, New York, 1995.
13. A.F. van der Stappen, Motion planning amidst fat obstacles, Ph.D. Thesis, Utrecht University, 1994.
14. A.F. van der Stappen, D. Halperin, M.H. Overmars, The complexity of the free space for a robot moving amidst fat obstacles, Computational Geometry 3 (1993) 353-373.
15. A.F. van der Stappen, M.H. Overmars, Motion planning amidst fat obstacles, in: Proc. 10th ACM Symp. on Computational Geometry, 1994, pp. 31-40.
16. M. van Kreveld, On fat partitioning, fat covering and the union size of polygons, Computational Geometry 9 (1998) 197-210.
17. J. Vleugels, On fatness and fitness - realistic input models for geometric algorithms, Ph.D. Thesis, Utrecht University, 1997.