Computing Convex Hulls with a Linear Solver
<|reference_start|>Computing Convex Hulls with a Linear Solver: 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)<|reference_end|>
@article{benoy2003computing,
    title={Computing Convex Hulls with a Linear Solver},
    author={Florence Benoy and Andy King and Fred Mesnard},
    journal={arXiv preprint arXiv:cs/0311002},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0311002},
    primaryClass={cs.PL}
}