An efficient implementation of the Double Description Method
-
Updated
Dec 15, 2024 - C
An efficient implementation of the Double Description Method
First-cut implementation of two newly discovered Efficient Algorithms to compute the tightest octagonal over-approximation of arbitary Polyhedra
The Julia distribution of the POlyhedron Representation Transformation Algorithm (PORTA).
Add a description, image, and links to the polyhedra topic page so that developers can more easily learn about it.
To associate your repository with the polyhedra topic, visit your repo's landing page and select "manage topics."