DC FieldValueLanguage
dc.contributor.authorŽunić, Jovišaen
dc.date.accessioned2020-05-01T20:29:02Z-
dc.date.available2020-05-01T20:29:02Z-
dc.date.issued1998-01-01en
dc.identifier.issn0024-6093en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1965-
dc.description.abstractIn this paper we consider connections between three classes of optimal (in different senses) convex lattice polygons. A classical result is that if G is a strictly convex curve of length s, then the maximal number of integer points lying on G is essentially 3/(2π)1/3 · s2/3 ≈ 1.625578 · s2/3. It is proved here that members of a class of digital convex polygons which have the maximal number of vertices with respect to their diameter are good approximations of these curves. We show that the number of vertices of these polygons is asymptotically 12/(2π(2+√2·In(1+√2)))2/3· s2/31.60739·s2/3, where s is the perimeter of such a polygon. This result implies that the area of these polygons is asymptotically less than 0.0191612·n3, where n is the number of vertices of the observed polygon. This result is very close to the result given by Colbourn and Simpson, which is 13/784·n3 ≈ 0.0191326·n3. The previous upper bound for the minimal area of a convex lattice n-gon is improved to 1/54·n3 ≈ 0.0185185·n3 as n → ∞.en
dc.publisherWiley-
dc.relation.ispartofBulletin of the London Mathematical Societyen
dc.titleNotes on optimal convex lattice polygonsen
dc.typeArticleen
dc.identifier.doi10.1112/S0024609398004482en
dc.identifier.scopus2-s2.0-0032128641en
dc.relation.firstpage377en
dc.relation.lastpage385en
dc.relation.issue4en
dc.relation.volume30en
dc.description.rankM22-
item.cerifentitytypePublications-
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0002-1271-4153-

#### SCOPUSTM Citations

7
checked on Jun 9, 2023

#### Page view(s)

27
checked on Jun 10, 2023