Six Topics on Inscribable Polytopes

DOI10.1007/978-3-662-50447-5_13zbMath1357.52016arXiv1511.03458OpenAlexW2168811089MaRDI QIDQ2832782

Arnau Padrol, Günter M. Ziegler

Publication date: 14 November 2016

Published in: Advances in Discrete Differential Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.03458

zbMATH Keywords

universalityneighborly polytopesinscribable polytopes

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10)

Related Items

COMBINATORIAL INSCRIBABILITY OBSTRUCTIONS FOR HIGHER DIMENSIONAL POLYTOPES, Continuous Maps from Spheres Converging to Boundaries of Convex Hulls

Cites Work

• Unnamed Item
• Unnamed Item
• Many neighborly polytopes and oriented matroids
• Toughness and Delaunay triangulations
• How to cage an egg
• Universality theorems for inscribed polytopes and Delaunay triangulations
• Graph-theoretical conditions for inscribability and Delaunay realizability
• Combinatorial optimization in geometry
• Many projectively unique polytopes
• On geometry of convex ideal polyhedra in hyperbolic 3-space
• Inscribable stacked polytopes
• Enumerating Neighborly Polytopes and Oriented Matroids
• The number of polytopes, configurations and real matroids
• A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere
• Separators for sphere-packings and nearest neighbor graphs
• Realization spaces of 4-polytopes are universal
• The maximum numbers of faces of a convex polytope