Inscribable stacked polytopes
arXiv:1111.5322
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.
arXiv comment15 pages, 16 figures