Inscribable stacked polytopes

DOI10.1515/ADVGEOM-2013-0014MaRDI QIDQ2858024zbMATH OpenOpenAlexFDO

Authors Bernd Gonska, Günter M. Ziegler

Publication date 19 November 2013

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

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)

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.

Recommendations

• About \(f\)-vectors of inscribed simplicial polytopes
• Neighborly inscribed polytopes and Delaunay triangulations
• Note on inscribability of quadrangular polyhedra with restricted number of edge-types
• Six topics on inscribable polytopes
• scientific article; zbMATH DE number 1359481

Cited in

(10)

• scientific article; zbMATH DE number 4026241 (Why is no real title available?)
• 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)