Selecting points that are heavily covered by pseudo-circles, spheres or rectangles

Combinatorics Probability and Computing

Volumn 13, Issue 3, 2004, Pages 389-411

  Smorodinsky, Shakhar ^a   Sharir, Micha ^a,b  

^a TEL AVIV UNIVERSITY   (Israel)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

NONEMPTY INTERSECTION; POLYLOGARITHMIC GAPS; PSEUDO-CIRCLES; RECURSIVE STEPS;

THEOREM PROVING;

EID: 3142641284     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548303005984     Document Type: Article

References (16)

1. Aigner, M. and Ziegler, G. M. (1998) Proofs from THE BOOK, Springer.
2. Aronov, B., Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir M. and Wenger, R. (1991) Points and triangles in the plane and halving planes in space. Discrete. Comput. Geom. 6 435-442.
3. Bárány, I. (1982) A generalization of Carathéodory's theorem. Discrete Math. 40 141-152.
4. Bern, M., Eppstein, D. and Gilbert, J. (1994) Provably good mesh generation. J. Comput. Syst. Sci. 48 384-409.
5. Boros, E. and Füredi, Z. (1984) The number of triangles covering the center of an n-set. Geom. Dedicata 17 69-77.
6. Chojnacki, Ch. (Hanani, A.) (1934) Über wesentlich unplättbare Kurven im dreidimensionalen Raume. Fund. Math. 23 135-142.
7. de Berg, M., van Kreveld, M., Overmars, M. and Schwarzkopf, O. (1997) Computational Geometry: Algorithms and Applications, Springer.
8. Chazelle, B., Edelsbrunner, H., Guibas, L., Hershberger, J., Seidel, R. and Sharir, M. (1994) Selecting heavily covered points. SIAM J. Comput. 23 1138-1151.
9. Edelsbrunner, H. (1987) Algorithms in Combinatorial Geometry (W. Brauer, G. Rozenberg and A. Salomaa, eds), Springer.
10. Lovász, L. (1971) On the number of halving lines. Ann. Univ. Scie. Budapest, de Rolando Eötvös Nominatae, Sectio Math. 14 107-108.
11. Lovász, L., Pach, J. and Szegedy, M. (1997) On Conway's thrackle conjecture. Discrete Comput. Geom. 18 369-376.
12. Moise, E. (1977) Geometric Topology in Dimensions 2 and 3, Springer.
13. Pach, J. and Agarwal, P. K. (1995) Combinatorial Geometry, Wiley.
14. Sharir, M. (2003) The Clarkson-Shor technique revisited and extended. Combin. Probab. Comput. 12 191-201.
15. Sharir, M., Smorodinsky, S. and Tardos, G. (2001) An improved bound for fe-sets in three dimensions. Discrete Comput. Geom. 26 195-204.
16. Tutte, W. T. (1970) Toward a theory of crossing numbers. J. Combin. Theory 8 45-53.