A note on bounds on the minimum area of convex lattice polygons

Charles J. Colbourn, R. J. Simpson

Research output: Contribution to journalArticle

6 Scopus citations

Abstract

The minimum area a(v) of a v–sided convex lattice polygon is known to satisfy [formula omitted]. We conjecture that a(v) = cv3 + o(v3), for c a constant; we prove that [formula omitted], and that for some positive constant c[formula omitted].

Original languageEnglish (US)
Pages (from-to)237-240
Number of pages4
JournalBulletin of the Australian Mathematical Society
Volume45
Issue number2
DOIs
StatePublished - Apr 1992
Externally publishedYes

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'A note on bounds on the minimum area of convex lattice polygons'. Together they form a unique fingerprint.

  • Cite this