In between k-sets, j-facets, and i-faces: (i, j)-partitions

Discrete and Computational Geometry

Volumn 29, Issue 1, 2003, Pages 105-131

  Andrzejak, Artur ^a   Welzl, Emo ^b  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037972824     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-002-2778-4     Document Type: Article

References (27)

1. Artur Andrzejak, On k-Sets and Their Generalizations, Ph.D. thesis, Swiss Federal Institute of Technology, Zurich (ETH Zurich), 2000.
2. Artur Andrzejak, Boris Aronov, Sariel Har-Peled, Raimund Seidel, and Emo Welzl, Results on k-sets and j-facets via continuous motions, in Proc. 14th Ann. ACM Symp. Comput. Geom. (SoCG '98) (1998), pp. 192-199.
3. Artur Andrzejak and Komei Fukuda, Optimization over k-set polytopes and efficient k-set enumeration, in Proc. 6th Internat. Workshop Alg. Data Struct. (WADS '99), pp. 1-12, Lecture Notes in Computer Science 1663, Springer-Verlag, Berlin, 1999.
4. Anders Björner, Michel Las Vergnas, Bernd Sturmfels, Neil White, and Günter M. Ziegler, Oriented Matroids, Encyclopedia of Mathematics 46, Cambridge University Press, Cambridge, 1993.
5. Sylvie Corteel, Gaël Rémond, Gilles Schaeffer, and Hugh Thomas, The number of plane corner cuts, Adv. Appl. Math. 23 (1999), 49-53.
6. Thomas M. Cover, Geometrical and statistical properties of systems of linear inequalities with applications in pattern recognition, IEEE Trans. Electron. Comput. 14 (1965), 326-334.
7. Tamal K. Dey, Improved bounds for planar k-sets and related problems, Discrete Comput. Geom. 19 (1998), 373-382.
8. Jürgen Eckhoff, Helly, Radon and Carathéodory type theorems, in Handbook of Convex Geometry, Vol. A (Eds. Peter M. Gruber and Jörg M. Wills), pp. 389-448, North-Holland, Amsterdam, 1993.
9. Herbert Edelsbrunner, Algorithms in Combinatorial Geometry, EATCS Monographs in Theoretical Computer Science 10, Springer-Verlag, Heidelberg, 1987.
10. Herbert Edelsbrunner, Pavel Valtr, and Emo Welzl, Cutting dense point sets in half, Discrete Comput. Geom. 17 (1997), 243-255.
11. Paul Erdos, László Lovász, A. Simmons, and Ernst G. Strauss, Dissection graphs of planar point sets, in A Survey of Combinatorial Theory (Eds. Jagdish N. Srivastava et al.), pp. 139-182, North-Holland, Amsterdam, 1973.
12. Jacob E. Goodman and Richard Pollack, Multidimensional sorting, SIAM J. Comput. 12 (1983), 484-507.
13. Ronald L. Graham, Donald E. Knuth, and Oren Patashnik, Concrete Mathematics, Addison-Wesley, Reading, MA, 1989.
14. Branko Grünbaum, Convex Polytopes, Interscience, London, 1967.
15. d. Discrete Comput. Geom. 18 (1997), 463-472.
16. Lászlo Lovász, On the number of halving lines, Ann. Univ. Sci. Budapest Eötvös, Sect. Math. 14 (1971), 107-108.
17. Jiří Matoušek, Lectures on Discrete Geometry, Springer-Verlag, New York, to appear.
18. Peter McMullen, The maximum numbers of faces of a convex polytope, Mathematika 17 (1970), 179-184.
19. Ketan Mulmuley, Dehn-Sommerville relations, upper bound theorem, and levels in arrangements, in Proc. 9th Ann. ACM Symp. Comput. Geom. (SoCG '93) (1993) pp. 240-246.
20. Shmuel Onn and Bernd Sturmfels, Cutting corners, Adv. Appl. Math. 23 (1999), 29-48.
21. Jürgen Richter-Gebert and Günter M. Ziegler, Oriented matroids, in Handbook of Discrete and Computational Geometry (Eds. Jacob E. Goodman and Joseph O'Rourke), pp. 111-132, CRC Press, Boca Raton, FL, 1997.
22. Micha Sharir, Shakar Smordinsky, and Gabor Tardos, An improved bound for k-sets in three dimensions, Discrete Comput. Geom. 26 (2001), 195-204.
23. Geza Tóth, Points with many k-sets, Discrete Comput. Geom. 26 (2001), 187-194.
24. Helge Tverberg, A generalization of Radon's theorem, J. London. Math. Soc. 41 (1966), 123-128.
25. Uli Wagner, On the number of corner cuts, Adv. Appl. Math. (2002), to appear.
26. Emo Welzl, Entering and leaving j-facets, Discrete Comput. Geom. 25 (2001), 351-364.
27. Günter M. Ziegler, Lectures on Polytopes, Graduate Texts in Mathematics 152, Springer-Verlag, Heidelberg, 1994.