Simplification of surface parametrizations—a lattice polygon approach

Given a convex lattice polygon, we compute a descending sequence of lattice polygons obtained by repeatedly passing to the convex hull of the interior lattice points. This process gives the idea for an algorithm that simplifies a given parametric surface by reparametrization.