Computing convex hulls with a linear solver

DOI10.1017/S1471068404002261MaRDI QIDQ4673547zbMATH OpenOpenAlexFDO

Authors Florence Benoy, Andy King, Fred Mesnard

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

abstract interpretationconvex hulllinear constraintspolyhedra

Mathematics Subject Classification ID

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

Recommendations

• Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\)
• Computing Convex Hulls by Automata Iteration
• Convex hull abstractions in specialization of CLP programs
• COMPUTING CONVEX HULLS BY AUTOMATA ITERATION
• scientific article; zbMATH DE number 1444288

Cited in

(11)

• scientific article; zbMATH DE number 1615255 (Why is no real title available?)
• Efficient elimination of redundancies in polyhedra by raytracing
• Convex hull abstractions in specialization of CLP programs
• 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
• Declarative reasoning on explanations using constraint logic programming
• An algorithm to find the lineality space of the positive hull of a set of vectors
• Global guidance for local generalization in model checking
• The convex hull of finitely generable subsets and its predicate transformer
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4673547)