|Title:||A simple construction of a digital convex n-gon with almost minimal diameter||Journal:||Information Sciences||Volume:||77||Issue:||3-4||First page:||275||Last page:||291||Issue Date:||1-Jan-1994||ISSN:||0020-0255||DOI:||10.1016/0020-0255(94)90005-1||Abstract:||
The paper presents a simple, almost optimal construction of a digital convex polygon with n edges, which can be included into an m × m grid of a minimal possible size m. The construction is almost optimal in the sense that the reached value for m is not more than 1 greater than the minimal possible value; such a conclusion is derived by comparison with a theoretical lower bound, which is also derived here.
Show full item record
checked on Mar 27, 2023
checked on Mar 28, 2023
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.