Hostname: page-component-745bb68f8f-g4j75 Total loading time: 0 Render date: 2025-02-06T13:09:21.673Z Has data issue: false hasContentIssue false
  • English
  • Français

Computing convex hulls with a linear solver

Published online by Cambridge University Press:  10 January 2005

FLORENCE BENOY ,
ANDY KING  and
FRED MESNARD
FLORENCE BENOY
Affiliation:
Computing Laboratory, University of Kent, Canterbury, Kent, UK (e-mail: p.m.benoy@kent.ac.uk, a.m.king@kent.ac.uk
ANDY KING
Affiliation:
Computing Laboratory, University of Kent, Canterbury, Kent, UK (e-mail: p.m.benoy@kent.ac.uk, a.m.king@kent.ac.uk
FRED MESNARD
Affiliation:
Iremia, Université de La Réunion, France (e-mail: fred@univ-reunion.fr)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Keywords

convex hullpolyhedraabstract interpretationlinear constraints
Type
PROGRAMMING PEARL
Information
Theory and Practice of Logic Programming , Volume 5 , Issue 1-2 , January 2005 , pp. 259 - 271
Copyright
© 2005 Cambridge University Press