The complexity of the union of (α,β)-covered objects

SIAM Journal on Computing

Volumn 34, Issue 4, 2005, Pages 775-787

  Efrat, Alon ^a  

^a University of Arizona   (United States)

Author keywords

Fat objects; Motion planning; Realistic input models

Indexed keywords

CONVEX OBJECTS; DAVENPORT-SCHINZEL SEQUENCE; FAT OBJECTS; REALISTIC INPUT MODELS;

BOUNDARY LAYERS; FUNCTIONS; MATHEMATICAL MODELS;

COMPUTATIONAL COMPLEXITY;

EID: 24344452560     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702407515     Document Type: Article

References (20)

1. P. AGARWAL AND M. SHARIR, Pipes, cigars, and Kreplach: The union of Minkowski sums in three dimensions, Discrete Comput. Geom., 24 (2000), pp. 645-685.
2. P. AGARWAL, M. KATZ, AND M. SHARIR, Computing depth orders for fat objects and related problems, Comput. Geom., 5 (1995), pp. 187-206.
3. B. ARONOV, A. EFRAT, V. KOLTUN, AND M. SHARIR, On the union of k-round objects in three and four Dimensions, in Proceedings of the 20th Annual Symposium on Computational Geometry, 2004, pp. 383-390.
4. B. CHAZELLE, H. EDELSBRUNNER, L. GUIBAS, AND M. SHARIR, Algorithms for bichromatic line segment problems and polyhedral terrains, Algorithmica, 11 (1994), pp. 116-132.
5. M. DE BERG, M. VAN KREVELD, M. H. OVERMARS, AND O. SCHWARZKOPF, Computational Geometry: Algorithms and Applications, 2nd ed., Springer-Verlag, Berlin, 2000.
6. A. EFRAT, The complexity of the union of (α, β)-covered objects, in Proceedings of the 15th Annual Symposium on Computational Geometry, 1999, pp. 134-142.
7. A. EFRAT AND M. SHARIR, The complexity of the union of fat objects in the plane, Discrete Comput. Geom., 23 (2000), pp. 171-189.
8. A. EFRAT AND M. KATZ, On the union of α-curved objects, Comput. Geom., 14 (1999), pp. 241254.
9. A. EFRAT, M. KATZ, F. NIELSEN, AND M. SHARIR, Dynamic data structures for fat objects and their applications, Comput. Geom., 15 (2000), pp. 215-227.
10. A. EFRAT, M. SHARIR, AND A. ZIV, Computing the smallest k-enclosing circle and related problems, Comput. Geom., 4 (1994), pp. 119-136.
11. M. KATZ, 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects, Comput. Geom., 8 (1997), pp. 299-316.
12. M. KATZ, M. OVERMARS, AND M. SHARIR, Efficient output sensitive hidden surface removal for objects with small union size, Comput. Geom., 2 (1992), pp. 223-234.
13. 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), pp. 59-71.
14. M. VAN KREVELD, On fat partitioning, fat covering, and the union size of polygons, in Proceedings of the 3rd Workshop Algorithms Data Structure, Lecture Notes in Comput. Sci. 709, Springer-Verlag, Berlin, 1993, pp. 452-463.
15. J. MATOUŠEK, J. PACH, M. SHARIR, S. SIFRONY, AND E. WELZL, Fat triangles determine linearly many holes, SIAM J. Comput., 23 (1994), pp. 154-169.
16. J. PACH AND G. TARDOS, On the boundary complexity of the union of fat triangles, SIAM J. Comput., 31 (2002), pp. 1745-1760.
17. J. PACH, I. SAFRUTI, AND M. SHARIR, The complexity of the union of cubes in three dimensions, Discrete Comput. Geom., to appear.
18. M. SHARIR AND P. K. AGARWAL, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, New York, 1995.
19. A. F. VAN DER STAPPEN, private communication, 1999.
20. A. F. VAN DER STAPPEN, Motion Planning Amidst Fat Obstacles, Ph.D. Dissertation, Utrecht University, 1994.