3-piercing of d-dimensional boxes and homothetic triangles

International Journal of Computational Geometry and Applications

Volumn 9, Issue 3, 1999, Pages 249-259

  Assa, Eyal ^a   Katz, Matthew J ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Geometric optimization; p center; Piercing set

Indexed keywords

EID: 0347871283     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195999000170     Document Type: Article

References (10)

1. E. Assa, "On Rectilinear and Polygonal p-Center and p-Piercing Problems," M.Sc. thesis, Tel-Aviv University, 1997.
2. d," Combinatorica, 2(3) (1982), 237-246.
3. G.N. Frederickson and D.B. Johnson, "The complexity of selection and ranking in X + Y and matrices with sorted rows and columns," J. Comput. Syst. Sci., 24 (1982), 197-208.
4. G.N. Frederickson and D.B. Johnson, "Finding kth paths and p-centers by generating and searching good data structures," J. Algorithms, 4 (1983), 61-80.
5. G.N. Frederickson and D.B. Johnson, "Generalized selection and ranking: sorted matrices," SIAM J. Comput., 13 (1984), 14-30.
6. A. Glozman, K. Kedem and G. Shpitalnik, "On some geometric selection and optimization problems via sorted matrices," Proc. 4th Workshop on Algorithms and Data Structures, 1995, 26-37.
7. M.J. Katz and F. Nielsen, "On piercing sets of objects," Proc. 12th ACM Symp. on Computational Geometry, 1996, 113-121.
8. N. Meggido and K.J. Supowit, "On the complexity of some common geometric location problems," SIAM J. Comput., 13 (1984), 182-196.
9. M. Segal, "On the piercing of axis-parallel rectangles and rings," Proc. 5th European Symp. on Algorithms, 1997, 430-442.
10. M. Sharir and E. Welzl, "Rectilinear and polygonal p-piercing and p-center problems," Proc. 12th ACM Symp. on Computational Geometry, 1996, 122-132.