Graph explorer

Inscribable stacked polytopes

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.

6 nodes5 linksoverview mapInscribable stacked polytopes
6 nodes5 links
Inscribable stacked polytopes6 visible / 6 total nodes / 6 links
Co-authorshipAuthorshipAuthorshipTopic signalTopic signalTopic signalWInscribable stacked polytopespreprint / 2011ABernd GonskaResearcherAGünter M. ZieglerResearcherTmath.CO8936 worksTmath.NA6807 worksTmath.MG1407 works
PaperSignal 105 links

Inscribable stacked polytopes

preprint / 2011

Open