An algorithm for a simple construction of suboptimal digital convex polygons

The relationship between the number of edges and the diameter of digital convex polygons was studied earlier. This paper gives a linear algorithm (w.r.t. the number of vertices) for a simple approximate construction of optimal digital convex polygons, that is, those digital convex polygons, which have the smallest possible diameter for a given number of edges. The algorithm partly uses the efficient construction of a special sequence of optimal digital convex polygons. It constructs in a simplified manner the suboptimal (with error tolerance equal to 1) digital convex polygons. The proofs of this suboptimality can be found in an earlier paper.