The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Computing Convex Hulls with a Linear Solver
[article]
2003
arXiv
pre-print
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. To appear in Theory and Practice of Logic Programming (TPLP)
arXiv:cs/0311002v1
fatcat:mgghnvolhzbmtbmi36zzyk2oqe