Inscribable stacked polytopes

DOI10.1515/ADVGEOM-2013-0014zbMath1288.52007arXiv1111.5322OpenAlexW2963957937MaRDI QIDQ2858024

Günter M. Ziegler, Bernd Gonska

Publication date: 19 November 2013

Published in: advg (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)

Related Items (9)

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

This page was built for publication: Inscribable stacked polytopes