Open Access
1997 ON THE MINIMUM AREA OF CONVEX LATTICE POLYGONS
Tian-Xin Cai
Taiwanese J. Math. 1(4): 351-354 (1997). DOI: 10.11650/twjm/1500406114

Abstract

A convex polygon is a polygon whose vertices are points on the integer lattice with interior angles all convex. Let $a(v)$ be the least possible area of a convex lattice polygon with $v$ vertices. It is known that $cv^{2.5}\leq a(v)\leq (15/784)v^3 + o(v^3)$. In this paper, we prove that $a(v)\geq (1/1152)v^3 + O(v^2)$.

Citation

Download Citation

Tian-Xin Cai. "ON THE MINIMUM AREA OF CONVEX LATTICE POLYGONS." Taiwanese J. Math. 1 (4) 351 - 354, 1997. https://doi.org/10.11650/twjm/1500406114

Information

Published: 1997
First available in Project Euclid: 18 July 2017

zbMATH: 0897.52002
MathSciNet: MR1486557
Digital Object Identifier: 10.11650/twjm/1500406114

Subjects:
Primary: 11H06 , 52C05

Keywords: admissible n-sequence , convex lattice polygons , minimum area

Rights: Copyright © 1997 The Mathematical Society of the Republic of China

Vol.1 • No. 4 • 1997
Back to Top
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy