Cutting dense point sets in half

Discrete and Computational Geometry

Volumn 17, Issue 3, 1997, Pages 243-255

  Edelsbrunner, H ^a   Valtr, P ^b,c   Welzl, E ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

^c CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031499115     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009291     Document Type: Article

References (22)

1. R. Alexander. Geometric methods in the study of irregularities of distribution. Combinatorica 10 (1990), 115-136.
2. N. Alon, M. Katchalski, and W. R. Pulleyblank. The maximum size of a convex polygon in a restricted set of points in the plane. Discrete Comput. Geom. 4 (1989), 245-251.
3. N. Alon and M. A. Perles. On the intersection of edges of a geometric graph by straight lines. Discrete Math. 60 (1986), 75-90.
4. 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.
5. I. Bárány, Z. Füredi, and L. Lovász. On the number of halving planes. Combinatorica 10 (1990), 175-183.
6. B. Chazelle and F. P. Preparata. Halfspace range search: an algorithmic application of k-sets. Discrete Comput. Geom. 1 (1986), 83-93.
7. R. Cole, M. Sharir, and C. K. Yap. On k-hulls and related problems. SIAM J. Comput. 16 (1987), 61-77.
8. R. L. Cook. Stochastic sampling in computer graphics. ACM Trans. Graphics 5 (1986), 51-72.
9. T. K. Dey and H. Edelsbrunner. Counting triangle crossings and halving planes. Discrete Comput. Geom. 12 (1994), 281-289.
10. 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.
11. H. Edelsbrunner and E. Welzl. Constructing belts in two-dimensional arrangements with applications. SIAM J. Comput. 15 (1986), 271-284.
12. D. Eppstein. Improved bounds for intersecting triangles and halving planes. J. Combin. Theory Ser. A 62 (1993), 176-182.
13. P. Erdös, L. Lovász, A. Simmons, and E. G. Straus. Dissection graphs of planar point sets. In A Survey of Combinatorial Theory, ed. J. N. Srivastava et al., pp. 139-149, North-Holland, Amsterdam, 1973.
14. J. E. Goodman, R. Pollack, and B. Sturmfels. Coordinate representation of order types requires exponential storage. Proc. 21st Ann. ACM Symp. on Theory of Computing, 1989, pp. 405-410.
15. d. J. Amer. Math. Soc. 3 (1990), 639-651.
16. L. Lovász. On the number of halving lines. Ann. Univ. Sci. Budapest Eötvös Sect. Math. 14 (1971), 107-108.
17. J. Pach, W. Steiger, and E. Szemerédi. An upper bound on the number of planar k-sets. Discrete Comput. Geom. 7 (1992), 109-123.
18. E. Ramos. The number of 3-sets of a finite point set in the plane. Rept. UIUCDCS-R-93-1843, Department of Computer Science, University of Illinois at Urbana-Champaign, IL, 1993.
19. L. A. Santaló. Integral Geometry and Geometric Probability. Addison-Wesley, Reading, MA, 1976.
20. P. Valtr. Convex independent sets and 7-holes in restricted planar point sets. Discrete Comput. Geom. 7 (1992), 135-152.
21. P. Valtr. Planar point sets with bounded ratios of distances. Ph.D. thesis, Fachbereich Mathematik, Freie Universität Berlin, Berlin, 1994.
22. R. T. Živaljević S. T. Vrećica. The colored Tverberg's problem and complexes of injective functions. J. Combin. Theory Ser. A 61 (1992), 309-318.