Formally Certifying the Vertex Set of a Polyhedron Faster than Informal Enumeration
This work presents a certificate-based approach for formally verifying the computation of the vertices of a polyhedron with a new completeness criterion based on an abstract simplicial complex that generalizes a triangulation of the normal fan of the polyhedron.
Xavier Allamigeon, Yazid Id-Sahra, Pierre-Yves Strub
· 0 citations