On piercing sets of axis-parallel rectangles and rings

International Journal of Computational Geometry and Applications

Volumn 9, Issue 3, 1999, Pages 219-233

  Segal, Michael ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Algorithms; Axis parallel; Computational geometry; Piercing

Indexed keywords

EID: 0033415537     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195999000157     Document Type: Article

References (7)

1. E. Assa, and M. Katz, "3-piercing of d-dimensional boxes and homothetic triangles," Int. J. Comput. Geom. and Appls, to appear.
2. M. Katz, and F. Nielsen, "On piercing sets of objects", In Proc. 12th ACM Symp. on Computational Geometry, 1996, pp. 113-121.
3. K. Mehlhorn, Data Structures and Algorithms 3: Multi-Dimensional Searching and Computational Geometry, Springer-Verlag, 1984.
4. M. Overmars, and C. Yap, "New upper bounds in Klee's measure problem," In Proc. 29 Annual IEEE Symp. on the Found. of Comput. Sci., 1988, pp. 550-556.
5. H. Samet, The design and analysis of spatial data structures, Addison-Wesley, 1990
6. M. Segal, and K. Kedem, "Enclosing k points in the smallest axis parallel rectangle," Information Processing Letters, 65 (1998), 95-99.
7. M. Sharir, and E. Welzl, "Rectilinear and polygonal p-piercing and p-center problems," In Proc. 12th ACM Symp. on Computational Geometry, 1996, pp. 122-132.