Andy King

collaborators

2 papers

cs.CG2004

Convex Hull of Planar H-Polyhedra

Axel Simon, Andy King

Suppose $< A_{i}, c_{i} >$ are planar (convex) H-polyhedra, that is, $A_{i} \in R^{n_{i} \times 2}$ and $c_{i} \in R^{n_{i}}$ . Let $P_i = \{\vec{x} \in \mathbb{R}^2…

cs.PL2003

Computing Convex Hulls with a Linear Solver

Florence Benoy, Andy King, Fred Mesnard

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…