Computing the Integer Hull of Convex Polyhedral Sets

In this paper, we discuss a new algorithm for computing the integer hull P-I of a rational polyhedral set P, together with its implementation in Maple and in the C programming language. Our implementation focuses on the two-dimensional and three-dimensional cases. We show that our algorithm computes the integer hull efficiently and can deal with polyhedral sets with large numbers of integer points.