Computing convex hulls with a linear solver

@article{Benoy2003ComputingCH,
  title={Computing convex hulls with a linear solver},
  author={Florence Benoy and Andy King and Fr{\'e}d{\'e}ric Mesnard},
  journal={TPLP},
  year={2003},
  volume={5},
  pages={259-271}
}
A programming tactic involving polyhedra is reported that has been widely applied in the polyhedral analysis of (constraint) logic programs. The method enables the computations of convex hulls that are required for polyhedral analysis to be coded with linear constraint solving machinery that is available in many Prolog systems. 

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 22 CITATIONS

Property Directed Polyhedral Abstraction

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

The Verified Polyhedron Library: an Overview

  • 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
  • 2018
VIEW 1 EXCERPT
CITES BACKGROUND

Toward Certification for Free

VIEW 2 EXCERPTS
CITES BACKGROUND & METHODS