An improved bound for k-sets in three dimensions

Discrete and Computational Geometry

Volumn 26, Issue 2, 2001, Pages 195-204

  Sharir, M ^a,b   Smorodinsky, S ^a   Tardos, G ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b NEW YORK UNIVERSITY   (United States)

^c INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035612718     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-001-0005-3     Document Type: Article

References (16)

1. P.K. Agarwal, B. Aronov, T. M. Chan, and M. Sharir, On levels in arrangements of lines, segments, planes, and triangles, Discrete Comput. Geom., 19 (1998), 315-331.
2. A. Andrzejak, B. Aronov, S. Har-Peled, R. Seidel, and E. Welzl, Results on k-sets and j-facets via continuous motion arguments, Proceedings of the 14th Annual ACM Symposium on Computational Geometry, 1998, pp. 192-199.
3. B. Aronov, B. Chazelle, H. Edelsbrunner, L. J. Guibas, M. Sharir, and R. Wenger, Points and triangles in the plane and halving planes in space, Discrete Comput. Geom., 6 (1991), 435-442.
4. I. Bárány, Z. Füredi, and L. Lovász, On the number of halving planes, Combinatorica, 10 (1990), 175-183.
5. R. Cole, M. Sharir, and C. K. Yap, On k-hulls and related problems, SIAM J. Comput., 16 (1987), 61-77.
6. T. K. Dey, Improved bounds on planar k-sets and related problems, Discrete Comput. Geom., 19 (1998), 373-382.
7. T. K. Dey and H. Edelsbrunner, Counting triangle crossings and halving planes, Discrete Comput. Geom., 12 (1994), 281-289.
8. H. Edelsbrunner, P. Valtr, and E. Welzl, Cutting dense point sets in half, Discrete Comput. Geom., 17 (1997), 243-255.
9. H. Edelsbrunner and E. Welzl, On the number of line separations of a finite set in the plane, J. Combin. Theory Ser. A, 40 (1985), 15-29.
10. P. Erdos, L. Lovász, A. Simmons, and E. Straus, Dissection graphs of planar point sets, in A Survey of Combinatorial Theory, J. N. Srivastava, ed., North-Holland, Amsterdam, 1973, pp. 139-154.
11. L. Lovász, On the number of halving lines, Ann. Univ. Sci. Budapest. Eötvös Sect. Math., 14 (1971), 107-108.
12. J. Pach, Notes on geometric graph theory, in Discrete and Computational Geometry: Papers from the DIMACS Special Year, Dimacs Series in Discrete Mathematics and Theoretical Computer Science, Vol. 6, American Mathematical Society, Providence, RI, 1991, pp. 273-285.
13. J. Pach and P.K. Agarwal, Combinatorial Geometry, Wiley-Interscience, New York, 1995.
14. M. Sharir, On k-sets in arrangements of curves and surfaces, Discrete Comput. Geom., 6 (1991), 593-613.
15. G. Tóth, On sets with many k-sets, Proceedings of the 16th Annual ACM Symposium on Computational Geometry, 2000, pp. 37-42.
16. E. Welzl, More on k-sets of finite sets in the plane, Discrete Comput. Geom., 1 (1986), 95-100.