[Haskell-cafe] Finding points contained within a convex hull.

Daniel McAllansmith dm.maillists at gmail.com
Tue Jun 5 20:23:03 EDT 2007


I've got a system of linear inequalities representing half-spaces.  The 
half-spaces may or may not form a convex hull.

I need to find the integral coordinates that are contained within the convex 
hull, if there is one.

For example, given
0 <= x <= 4
0 <= y <= 3
0 <= 2x - y
0 <= 1.2y - x

I want the following (x,y) coordinates

Anybody have any suggestions, or libraries, for solving this in many 
dimensions and equations?


More information about the Haskell-Cafe mailing list