Problem Class: Convex and integer-hull & lattice-point problems — master class

Umbrella class for convex hull (primal/dual), integer hull facet enumeration, lattice point counting, and Voronoi by lifting. Groups problems studied in the Assarf et al. polymake paper.

algorithmic task

MaRDI QIDQ6825509FDOCommunityMathAlgoDB

Specializations

Problem: Compute Voronoi diagram via paraboloid lifting and dual convex hull, Problem: Compute the integer hull and its facet description of a rational polyhedron, Problem: Count or enumerate integer lattice points in a convex polytope, Problem: Compute vertices/extreme rays from halfspaces (H-representation to V-representation) — dual convex hull / vertex enumeration, Problem: Construct the convex hull of points (V-representation to H-representation) — primal convex hull

---

---

Edit Problem Class: Convex and integer-hull & lattice-point problems — master class item

This page was built for task: Problem Class: Convex and integer-hull & lattice-point problems — master class