COMBINATORIAL INSCRIBABILITY OBSTRUCTIONS FOR HIGHER DIMENSIONAL POLYTOPES
Sign Up to like & getrecommendations! Published in 2020 at "Mathematika"
DOI: 10.1112/mtk.12051
Abstract: For $3$-dimensional convex polytopes, inscribability is a classical property that is relatively well-understood due to its relation with Delaunay subdivisions of the plane and hyperbolic geometry. In particular, inscribability can be tested in polynomial time,… read more here.
Keywords: dimensional polytopes; higher dimensional; cyclic polytopes; combinatorial inscribability ... See more keywords