Algorithm: Double Description method for vertex and extreme-ray enumeration

MaRDI QIDQ6825767FDO

Maintains inner/outer descriptions of a cone or polyhedron and updates extrema upon adding constraints. Classical for H→V conversion, robust on degenerate inputs.

Described by source

• 3. The Double Description Method
• Computing convex hulls and counting integer points with polymake
• Double description method revisited
• How good are convex hull algorithms?

This page was built for algorithm: Algorithm: Double Description method for vertex and extreme-ray enumeration