Efficient Elimination of Redundancies in Polyhedra by Raytracing

DOI10.1007/978-3-319-52234-0_20zbMath1487.90645OpenAlexW2546000176MaRDI QIDQ2961577

Michael Périn, Alexandre Maréchal

Publication date: 21 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-52234-0_20

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (2)

Minimal representations of a face of a convex polyhedron and some applications ⋮ Efficient Elimination of Redundancies in Polyhedra by Raytracing

Uses Software

• Apron
• LAPACK
• PolyLib
• Verasco

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Applications of polyhedral computations to the analysis and verification of hardware and software systems
• New modification of the double description method for constructing the skeleton of a polyhedral cone
• Efficient Elimination of Redundancies in Polyhedra by Raytracing
• LAPACK Users' Guide
• Computing convex hulls with a linear solver
• Algorithm for discovering the set of all the solutions of a linear programming problem
• Static Analysis

This page was built for publication: Efficient Elimination of Redundancies in Polyhedra by Raytracing