Improved bounds for planar k-sets and related problems

Discrete and Computational Geometry

Volumn 19, Issue 3, 1998, Pages 373-382

  Dey, T K ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032394371     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009354     Document Type: Article

References (32)

1. M. Ajtai, V. Chvátal, M. M. Newborn, and E. Szemerédi. Crossing-free subgraphs. Ann. Discrete Math., 12 (1982), 9-12.
2. N. Alon and E. Gyori. The number of small semispaces of a finite set of points in the plane. J. Combin. Theory Ser. A, 41 (1986), 154-157.
3. P.K. Agarwal, B. Aronov, and M. Sharir. On levels in arrangements of lines, segments, planes and triangles. In: Proc. 13th Annu. ACM Sympos. Comput. Geom. 1997, pp. 30-38.
4. N. Alon, I. Bárány, Z. Füredi, and D. J. Kleitman. Point selections and weak ε-nets for convex hulls. Combin. Probab. Comput., 1 (1992), 295-302.
5. 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.
6. I. Bárány, Z. Füredi, and L. Lovász. On the number of halving planes. Combinatorica, 10 (1990), 140-144.
7. I. Bárány and W. Steiger. On the expected number of k-sets. Discrete Comput. Geom., 11 (1994), 243-263.
8. B. Chazelle and F. P. Preparata. Half-space range search: An algorithmic application of k-sets. Discrete Comput. Geom., 1 (1986), 83-93.
9. R. Cole, M. Sharir, and C. K. Yap. On k-hulls and related problems. SIAM J. Comput., 16 (1987), 61-77.
10. K. Clarkson, H. Edelsbrunner, L. J. Guibas, and M. Sharir. Combinatorial complexity bounds for arrangements of curves and surfaces. Discrete Comput. Geom., 5 (1990), 99-160.
11. K. Clarkson and P. Shor. Applications of random sampling in computational geometry II. Discrete Comput. Geom., 4 (1989), 387-421.
12. T. K. Dey. On counting triangulations in d dimensions. Comput. Geom. Theory Appl., 3 (1993), 315-322.
13. T. K. Dey. Improved bounds for k-sets and k-th levels. Manuscript, 1997.
14. T. K. Dey and H. Edelsbrunner. Counting triangle crossings and halving planes. Discrete Comput. Geom., 12 (1994), 281-289.
15. T. K. Dey and J. Pach. Extremal problems for geometric hypergraphs. In: Proc. 7th Intl. Sympos. ISAAC'96, Lecture Notes in Computer Science, vol. 1178, 1996, pp. 105-114. To appear in Discrete Comput. Geom., 1997.
16. T. K. Dey and J. Pach. Extremal problems for geometric hypergraphs. In: Proc. 7th Intl. Sympos. ISAAC'96, Lecture Notes in Computer Science, vol. 1178, 1996, pp. 105-114. To appear in Discrete Comput. Geom., 1997.
17. d. In: Proc. 7th Canad. Conf. Comput. Geom. 1995, pp. 31-36. To appear in Comput. Geom. Theory Appl., 1997.
18. d. In: Proc. 7th Canad. Conf. Comput. Geom. 1995, pp. 31-36. To appear in Comput. Geom. Theory Appl., 1997.
19. H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Heidelberg, 1987.
20. H. Edelsbrunner, P. Valtr, and E. Welzl. Cutting dense point sets in half. Discrete Comput. Geom., 17 (1997), 243-255.
21. H. Edelsbrunner and E. Welzl. On the number of line separations of a finite set in the plane. J. Combin. Theory, Ser. A, 38 (1985), 15-29.
22. P. Erdos, L. Lovász, A. Simmons, and E. G. Straus. Dissection graphs of planar point sets. In A Survev of Combinatorial Theory (J. N. Srivastava et al., eds.), North-Holland, Amsterdam, 1973, pp. 139-149.
23. D. Eppstein. Geometric lower bounds for parametric matroid optimization. In: Proc. 27th Annu. ACM Sympos. Theory Comput. 1995, pp. 662-671.
24. D. Gusfield. Bounds for the parametric spanning tree problem. In: Proc. Humbolt Conf. Graph Theory, Combinatorics and Computing, pp. 173-183. Utilitas Mathematica, 1979.
25. J. Hershberger and J. Snoeyink. Convex polygons made from few lines and convex decompositions of polyhedra. In: Proc. 3rd Scand. Workshop on Algorithm Theory, Lecture Notes in Computer Science, vol. 621. Springer-Verlag, New York, 1992, pp. 376-387.
26. L. Lovász. On the number of halving lines. Ann. Univ. Sci. Budapest, Eötvös, Sec. Math., 14 (1971), 107-108.
27. J. Pach, W. Steiger, and E. Szemerédi. An upper bound on the number of planar k-sets. In: Proc. 30th Ann. IEEE Sympos. Found. Comput. Sci., 1989, pp. 72-79.
28. J. Pach and G. Tóth. Graphs drawn with few crossings per edge. In: Proc. Graph Drawing 1996, Berkeley (S. North ed.), Lecture Notes in Computer Science, vol. 1190, Springer-Verlag, Berlin, 1997, pp. 345-354.
29. M. Sharir. On k-sets in arrangements of curves and surfaces. Discrete Comput. Geom., 6 (1991), 593-613.
30. L. A. Székely. Crossing numbers and hard Erdos problems in discrete geometry. Manuscript, 1996.
31. E. Welzl. More on k-sets of finite sets in the plane. Discrete Comput. Geom., 3 (1986), 95-100.
32. R. Živaljević and S. Vrećica. The colored Tverberg's problem and complexes of injective functions. J. Combin. Theory, Ser. A, 61 (1992), 309-318.