Let e(m) denote the maximal number of edges of a convex digital polygo
n included into an m X m square area of lattice points and let s(n) de
note the minimal (side) size of a square in which a convex digital pol
ygon with n edges can be included. We prove that [GRAPHICS] (c) 1995 A
cademic Press, Inc.