On a construction of digital convex (2s+1)-gons of minimum diameter

On a construction of digital convex (2s+1)-gons of minimum diameter

0.00 Avg rating0 Votes
Article ID: iaor1997296
Country: Serbia
Volume: 5
Start Page Number: 39
End Page Number: 51
Publication Date: Sep 1995
Journal: Yugoslav Journal of Operations Research
Authors: ,
Keywords: sets
Abstract:

In this paper an algorithm is described for an exact construction of digital convex (2s+1)-gons of minimum diameter. A complete family of auxiliary so-called perfect BAsic b-tuples is obtained by applying this algorithm. The required optimal (2s+1)-gons can be easily constructed from this family.

Reviews

Required fields are marked *. Your email address will not be published.