K-sets in four dimensions

Discrete and Computational Geometry

Volumn 35, Issue 2, 2006, Pages 177-191

  Matousek, Jiri ^a   Sharir, Micha ^b,c   Smorodinsky, Shakhar ^c   Wagner, Uli ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

^b TEL AVIV UNIVERSITY   (Israel)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 31144440702     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-005-1200-4     Document Type: Article

References (17)

1. P. Agarwal, B. Aronov, T. Chan, and M. Sharir, On levels in arrangements of lines, segments, planes, and triangles, Discrete Comput. Geom. 19 (1998), 315-331.
2. M. Ajtai, V. Chvátal, M.M. Newborn, and E. Szemerédi, Crossing-free subgraphs, Ann. Discrete Math. 12 (1982), 9-12.
3. A. Andrzejak and E. Welzl, In between k-sets, j-facets, and i-faces: (i, j)-partitions, Discrete Comput. Geom. 29 (2003), 105-131.
4. B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and R. Wenger, Points and triangles in the plane and halving planes in space, Discrete Comput. Geom. 6 (1991), 435-442.
5. I. Bárány, Z. Füredi and L. Lovász, On the number of halving planes, Combinatorica 10 (1990), 175-183.
6. T. Dey, Improved bounds for planar k-sets and related problems, Discrete Comput. Geom. 19 (1998), 373-382.
7. T. Dey and H. Edelsbrunner, Counting triangle crossings and halving planes, Discrete Comput. Geom. 12 (1994), 281-289.
8. T. Dey and J. Pach, Extremal problems for geometric hypergraphs, Discrete Comput. Geom. 19 (1998), 473-484.
9. P. Erdo′s, L. Lovász, A. Simmons, and E.G. Strauss, Dissection graphs of planar point sets, in Survey Combinat. Theory, Sympos., Colorado State Univ., Colorado 1971, pp. 139-149, 1973.
10. F.T. Leighton, Complexity Issues in VLSI, Foundations of Computing Series, MIT Press, Cambridge, MA, 1983.
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. Matoušek, Lectures on Discrete Geometry, Graduate Texts in Mathematics, Springer-Verlag, Berlin, 2002.
13. J. Fach and P.K. Agarwal, Combinatorial Geometry, Wiley-Interscience, New York, 1995.
14. M. Sharir, S. Smorodinsky, and G. Tardos, An improved bound for k-sets in three dimensions, Discrete Comput. Geom. 26 (2001), 195-204.
15. L. Székely, Crossing numbers and hard Erdo′s problems in discrete geometry, Combin. Probab. Comput. 6 (1997), 353-358.
16. G. Tóth, Point sets with many k-sets, Discrete Comput. Geom. 26 (2001), 187-194.
17. R.T. Živaljević and S.T. Vrećica, The colored Tverberg theorem and complexes of injective functions, J. Combin. Theory, Ser. A 61 (1992), 309-318.