Inscribable stacked polytopes
Metric Geometry
2011-11-23 v1 Combinatorics
Numerical Analysis
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.
Keywords
Cite
@article{arxiv.1111.5322,
title = {Inscribable stacked polytopes},
author = {Bernd Gonska and Günter M. Ziegler},
journal= {arXiv preprint arXiv:1111.5322},
year = {2011}
}
Comments
15 pages, 16 figures