ARBITRARILY LARGE NEIGHBORLY FAMILIES OF CONGRUENT SYMMETRIC CONVEX 3-POLYTOPES

Discrete Geometry: In Honor of W. Kuperberg's 60th Birthday

Volumn , Issue , 2003, Pages 267-278

  Erickson, Jeff ^a   Kim, Scott ^b  

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

^b NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85180028698     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9780203911211-19     Document Type: Chapter

References (32)

1. N. Amenta, S. Levy, T. Munzner, and M. Philips. Geomview: A system for geometric visualization. Proc. 11th Annu. ACM Sympos. Comput. Geom., (1995), C12-C13.
2. C. B. Barber, D. P. Dobkin, and H. Huhdanpaa. The Quickhull algo­rithm for convex hulls. ACM Trans. Math. Softw., 22 (1996), 469-483.
3. C. B. Barber and H. Huhdanpaa. Qhull, version 3.0, February 2000. (http://www.geom.umn.edu/software/qhull/).
4. A. S. Besicovitch. On Crum's problem. J. London Math. Soc., 22 (1947), 285-287.
5. D. Bochis and F. Santos. On the number of facets of Dirichlet stereo- hedra I: Groups with reflections. Discrete Comput. Geom., 25 (2001), 419-444.
6. D. Bochis and F. Santos. On the number of facets of Dirichlet stereohedra II: Non-cubic groups. Preprint, April 2002. arXiv:math. CO/0204231.
7. C. Caratheodory. Uber den Variabilitatsbereich der Fourier'schen Kon­stanten von positiven harmonischen Funktionen. Rendiconto del Circolo Matematico di Palermo, 32 (1911), 193-217.
8. H. P. Croft, K. J. Falconer, and R. K. Guy. Unsolved Problems in Geometry. Springer-Verlag, 1991.
9. L. Danzer, B. Griinbaum, and V. Klee. Helly's theorem and its relatives. Convexity, pp. 101-180. Proc. Symp. Pure Math., vol. VII, Amer. Math. Soc., 1963.
10. A. K. Dewdney and J. K. Vranch. A convex partition of R3 with applications to Crum's problem and Knuth's post-office problem. Utilitas Math., 12 (1977), 193-199.
11. H. G. Eggleston. On Rado's extension of Crum's problem. J. London Math. Soc., 28 (1953), 467-471.
12. J. Erickson. Nice point sets can have nasty Delaunay triangulations. Proc. 17th Annu. ACM Sympos. Comput. Geom. (2001), 96-105. arXiv: cs.CG/0103017.
13. D. Gale. Neighborly and cyclic polytopes. Convexity, pp. 225-232. Proc. Symp. Pure Math., vol. 7, Amer. Math. Soc., 1963.
14. M. Gardner. Pool-ball triangles and other problems. Chapter 9 of Penrose Tiles to Trapdoor Ciphers, pp. 119-136. W. H. Freeman, 1989.
15. B. Griinbaum. Convex Polytopes. John Wiley & Sons, New York, NY, 1967.
16. B. Griinbaum and T. S. Motzkin. On polyhedral graphs. Convexity, pp. 285-290. Proc. Symp. Pure Math., vol. VII, Amer. Math. Soc., 1963.
17. F. Guthrie. Proc. Royal Soc. Edinburgh, 10 (1878-1880), 728.
18. V. Klee. On the complexity of d-dimensional Voronoi diagrams. Archiv der Math., 34 (1980), 75-80.
19. S. Levy, T. Münzner, M. Phillips, C. Fowler, N. Thurston, D. Krech, S. Wisdom, D. Meyer, T. Rowley, and S. M. Robbins. Geomview, version 1.8.1, March 2001. (http://www.geomview.org).
20. W. Moser and J. Pach. Research problems in discrete geometry: Packing and covering. Tech. Rep. 93-32, DIMACS, 1993.
21. T. S. Motzkin. Comonotone curves and polyhedra. Bull. Amer. Math. Soc., 63 (1957), 35.
22. R. Rado. A sequence of polyhedra having intersections of specified dimensions. J. London Math. Soc., 22 (1947), 287-289.
23. A. UlamKMH [Yu. A. Saskin]. BaMeuanne o cocbahhx Bepnmiiax sa BBinyKJioM MHororpanaHHMKe [A remark on adjacent vertices on a convex polyhedron], Ycnexu MameM. Hayn. [Uspehi Mat. Nauk], 18 (1963), 209-211.
24. G. C. Shepherd. A theorem on cyclic polytopes. Israel J. Math., 6 (1968), 368-372.
25. R. Seidel. Exact upper bounds for the number of faces in d-dimensional Voronoi diagrams. Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift, pp. 517-530. DIMACS Series Discrete Mathe­matics and Theoretical Computer Science, vol. 4, AMS Press, 1991.
26. P. Stöckel. Z. Math. Phys., 42 (1897), 275.
27. H. Tietze. Uber das Problem der Nachbargite im Raum. Monatsh. Math. Phys., 16 (1905), 211-216.
28. H. Tietze. Famous Problems of Mathematics: Solved and Unsolved Mathematical Problems from Antiquity to Modern Times. Graylock Press, New York, 1965. Translation of Gelöste und ungelöste mathe­matische Probleme aus alter und neuer Zeit, 2nd edition, Verlag C. H. Beck, München, 1959.
29. J. Zaks. Arbitrarily large neighborly families of symmetric convex polytopes. Geom. Dedicata, 20 (1986), 175-179.
30. J. Zaks. Neighborly families of congruent convex polytopes. Amer. Math. Monthly, 94 (1987), 151-155.
31. J. Zaks. Personal communication, April 2001.
32. G. M. Ziegler. Lectures on Polytopes. Graduate Texts in Mathematics, vol. 152. Springer-Verlag, Heidelberg, 1994.