Computing convex hulls with a linear solver

DOI10.1017/S1471068404002261zbMath1093.68016OpenAlexW2109075404MaRDI QIDQ4673547

Fred Mesnard, Florence Benoy, Andy King

Publication date: 29 April 2005

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1471068404002261

zbMATH Keywords

polyhedraconvex hulllinear constraintsabstract interpretation

Mathematics Subject Classification ID

Logic programming (68N17) Theory of software (68N99)

Related Items (5)

Efficient Elimination of Redundancies in Polyhedra by Raytracing ⋮ Applying abstract acceleration to (co-)reachability analysis of reactive programs ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems

This page was built for publication: Computing convex hulls with a linear solver