Inscribable stacked polytopes

DOI10.1515/ADVGEOM-2013-0014zbMATH Open1288.52007arXiv1111.5322OpenAlexW2963957937MaRDI QIDQ2858024FDOQ2858024

Günter M. Ziegler, Bernd Gonska

Publication date: 19 November 2013

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

Abstract: We characterize the combinatorial types of stacked d-polytopes that are inscribable. Equivalently, we identify the triangulations of a simplex by stellar subdivisions that can be realized as Delaunay triangulations.

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

zbMATH Keywords

Delaunay triangulationsstellar subdivisionstacked polytopesinscribable polytopes

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11)

Cited In (9)

• About \(f\)-vectors of inscribed simplicial polytopes
• Realizability and inscribability for simplicial polytopes via nonlinear optimization
• COMBINATORIAL INSCRIBABILITY OBSTRUCTIONS FOR HIGHER DIMENSIONAL POLYTOPES
• Neighborly inscribed polytopes and Delaunay triangulations
• Apollonian ball packings and stacked polytopes
• Scribability problems for polytopes
• Six Topics on Inscribable Polytopes
• On ill-conceived initialization in archetypal analysis
• Universality theorems for inscribed polytopes and Delaunay triangulations

This page was built for publication: Inscribable stacked polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2858024)