Arbitrarily Large Neighborly Families of Congruent Symmetric Convex 3-Polytopes

2001/06/12 by Jeff Erickson, Erickson, Jeff
Computer Science · Engineering · Mathematics · #Computational Geometry and Mesh Generation #Point processes and geometric inequalities #graph theory and CDMA systems #math.CO #math.MG #msc:52B05

paper · pdf · doi:10.48550/arxiv.math/0106095

9 pages, 5 figures

arxiv created 2001/06/12 · arxiv updated 2009/11/30

Abstract

We construct, for any positive integer n, a family of n congruent convex polyhedra in R³, such that every pair intersects in a common facet. Previously, the largest such family contained only eight polytopes. Our polyhedra are Voronoi regions of evenly distributed points on the helix (t, cos t, sin t). With a simple modification, we can ensure that each polyhedron in the family has a point, a line, and a plane of symmetry. We also generalize our construction to higher dimensions and introduce a new family of cyclic polytopes.

Related

• Neighborly inscribed polytopes and Delaunay triangulations
• Explicit constructions of centrally symmetric k-neighborly polytopes and large strictly antipodal sets
• The Discovery of a New Series of Uniform Polyhedra
• Centrally symmetric polytopes with many faces
• The largest small polytopes