The best ways to slice a polytope
DOI10.1090/mcom/4006MaRDI QIDQ6657200
Chiara Meroni, Marie-Charlotte Brandenburg, Jesús A. De Loera
Publication date: 6 January 2025
Published in: Mathematics of Computation (Search for Journal in Brave)
volumepolytopeshyperplane arrangementshyperplane sectionscombinatorial types of polytopesextremal problems on polytopesintegration over polyhedral regionsoptimal slices
(n)-dimensional polytopes (52B11) Computational aspects related to convexity (52B55) Combinatorial optimization (90C27) Inequalities and extremum problems involving convexity in convex geometry (52A40) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Semialgebraic sets and related spaces (14P10) Combinatorial complexity of geometric structures (52C45)
This page was built for publication: The best ways to slice a polytope
