Digital Convexity, Straightness, and Convex Polygons

New schemes for digitizing regions and arcs are introduced. It is then shown that under these schemes, Sklansky´s definition of digital convexity is equivalent to other definitions. Digital convex polygons of n vertices are defined and characterized in terms of geometric properties of digital line segments. Also, a linear time algorithm is presented that, given a digital convex region, determines the smallest integer n such that the region is a digital convex n-gon.