Entering and leaving j-facets

Discrete and Computational Geometry

Volumn 25, Issue 3, 2001, Pages 351-364

  Welzl, E ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035607411     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004540010085     Document Type: Article

References (20)

1. Noga Alon and Ervin Gyori, The number of small semispaces of a finite set of points in the plane, J. Combin. Theory Ser. A 41 (1986). 154-157.
2. Artur Andrzejak, Boris Aronov, Sariel Har-Peled, Raimund Seidel, and Emo Welzl, Results on k-sets and j-facets via continuous motion, in Proc. 14th Ann. ACM Symp. on Comput. Geom. (1998), pp. 192-199.
3. Artur Andrzejak and Emo Welzl, Halving point sets, Documenta Mathematica, Extra Volume ICM 98, Proceedings of the International Congress of Mathematicians (G. Fischer and U. Rehmann, Eds.), Berlin, Vol. III (1998), pp. 471-478.
4. Louis J. Billera and Carl W. Lee, A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes. J. Combin. Theory Ser. A 31 (1981), 237-255.
5. Kenneth L. Clarkson, A bound on local minima of arrangements that implies the Upper Bound Theorem, Discrete Comput. Geom. 10 (1993), 427-433.
6. Kenneth L. Clarkson and Peter W. Shor, Applications of random sampling in computational geometry, II, Discrete Comput. Geom. 4 (1989), 387-421.
7. Tamal K. Dey, Improved bounds for planar k-sets and related problems, Discrete Comput. Geom. 19 (1998), 373-382.
8. Paul Erdos, László Lovász, A. Simmons, and Ernst G. Straus, Dissection graphs of planar point sets, in A Survey of Combinatorial Theory (Jagdish N. Srivastava et al., Eds.), North-Holland, Amsterdam (1973), pp. 139-149.
9. Branko Grünbaum, Convex Polytopes, Interscience, New York (1967).
10. Carl W. Lee, Winding numbers and the generalized lower-bound conjecture, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 6 AMS, Providence, RI (1991), pp. 209-219.
11. Johann Linhart, The upper bound conjecture for arrangements of halfspaces, Beiträge Algebra Geom. 35 (1994), 29-35.
12. László Lovász, On the number of halving lines, Ann Univ. Sci. Budapest Eötvös Sect. Math. 14 (1971), 107-108.
13. Peter McMullen, The maximum numbers of faces of a convex polytope, Mathematika 17 (1970), 179-184.
14. Peter McMullen, On simple polytopes, Invent. Math. 113 (1993), 419-444.
15. Ketan Mulmuley, Dehn-Sommerville relations, Upper Bound Theorem, and levels in arrangements, in Proc. 9th Ann. ACM Symp. on Comput. Geom. (1993), pp. 240-246.
16. G. W. Peck, On k-sets in the plane, Discrete Math. 56 (1985), 73-74.
17. Micha Sharir, Shakhar Smorodinsky, and Gábor Tardos, An improved bound for k-sets in three dimensions, in Proc. 16th Ann. ACM Symp. on Comput. Geom. (2000), pp. 43-49.
18. Richard P. Stanley, The number of faces of simplicial polytopes and spheres, in Discrete Geometry and Convexity (J. E. Goodman, E. Lutwak, J. Malkevitch, and R. Pollack, Eds.), Annals New York Academy of Sciences, Vol. 440 (1985), pp. 212-223.
19. Géza Tóth, Point sets with many k-sets, in Proc. 16th Ann. ACM Symp. on Comput. Geom. (2000), pp. 37-42.
20. Günter M. Ziegler, Lectures on Polytopes. Graduate Texts in Mathematics, Springer-Verlag, New York (1995).