On the reconstruction of polytopes
From MaRDI portal
Publication:1715999
DOI10.1007/s00454-018-9997-9zbMath1407.52009arXiv1702.08739MaRDI QIDQ1715999
Eran Nevo, Julien Ugon, Joseph Doolittle, David Yost, Guillermo Pineda-Villavicencio
Publication date: 29 January 2019
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.08739
52B05: Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)
52B12: Special polytopes (linear programming, centrally symmetric, etc.)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding a simple polytope from its graph in polynomial time
- Puzzles and polytope isomorphisms
- A simple way to tell a simple polytope from its graph
- The almost simple cubical polytopes
- On the \(k\)-systems of a simple polytope
- Complete enumeration of small realizable oriented matroids
- Polytopes close to being simple
- Lectures on Polytopes
- Convex Polytopes
- The Excess Degree of a Polytope