Algorithms for finding tight UTVPI (octagonal) over-approximations of polyhedra using linear programming and Fourier-Motzkin elimination
-
Updated
Jul 17, 2019 - C++
Algorithms for finding tight UTVPI (octagonal) over-approximations of polyhedra using linear programming and Fourier-Motzkin elimination
Add a description, image, and links to the over-approximations topic page so that developers can more easily learn about it.
To associate your repository with the over-approximations topic, visit your repo's landing page and select "manage topics."