Inscribable stacked polytopes
Please always quote using this URN:urn:nbn:de:0296-matheon-9418
- 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.
- Wir charakterisieren die kombinatorischen Typen von d-dimensionalen Stapelpolytopen, die einschreibbar sind. Äquivalent dazu: Wir identifizieren die stellaren Unterteilungen eines Simplex, die als Delaunay-Triangulierungen realisiert werden können.
| Author: | Bernd Gonska, Günter M. Ziegler |
|---|---|
| URN: | urn:nbn:de:0296-matheon-9418 |
| Referee: | John M. Sullivan |
| Document Type: | Preprint, Research Center Matheon |
| Language: | English |
| Date of first Publication: | 2011/12/11 |
| Release Date: | 2011/12/11 |
| Tag: | Delaunay triangulations; face numbers of polytopes; lower bound theorem; stellar subdivisions; stereographic projection |
| Institute: | Freie Universität Berlin |
| Research Center Matheon | |
| MSC-Classification: | 52-XX CONVEX AND DISCRETE GEOMETRY / 52Bxx Polytopes and polyhedra / 52B12 Special polytopes (linear programming, centrally symmetric, etc.) |
| 65-XX NUMERICAL ANALYSIS / 65Dxx Numerical approximation and computational geometry (primarily algorithms) (For theory, see 41-XX and 68Uxx) / 65D18 Computer graphics, image analysis, and computational geometry [See also 51N05, 68U05] | |
| Preprint Number: | 830 |
