Inscribable stacked polytopes
Bernd Gonska, G\"unter M. Ziegler
TL;DR
This paper characterizes which stacked d-polytopes can be inscribed and identifies the triangulations of a simplex that can be realized as Delaunay triangulations.
Contribution
It provides a characterization of inscribable stacked polytopes and links them to Delaunay triangulations via stellar subdivisions.
Findings
Identifies combinatorial types of inscribable stacked polytopes.
Connects inscribability with Delaunay realizability.
Characterizes triangulations of a simplex via stellar subdivisions.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.