The Minimum Area of Convex Lattice n-Gons

Imre Bárány* and Norihide Tokushige

View Related Documents

Journal Article
Circumscribed Polygons of Small Area
Dan Ismailescu
Discrete & Computational Geometry, 2009, Volume 41, Number 4, Pages 583-589
- Download PDF (206.9 KB)
Book Chapter
Retiming
2004, Timing, Pages 207-248
- Download PDF (2.6 MB)
Book Chapter
Packaging Options—Chip on Board
2007, Integrated Circuit Packaging, Assembly and Interconnections, Pages 93-101
- Download PDF (1.8 MB)
Book Chapter
Adjustment of Surveillance Video Systems by a Performance Evaluation Function
Óscar Pérez, Jesús García, Antonio Berlanga and José M. Molina
Lecture Notes in Computer Science, 2005, Volume 3562, Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach, Pages 86-117
- Download PDF (434.5 KB)
Book Chapter
Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle
Sandip Das, Partha P. Goswami and Subhas C. Nandy
Lecture Notes in Computer Science, 2005, Volume 3480, Computational Science and Its Applications – ICCSA 2005, Pages 69-79
- Download PDF (171.4 KB)
Book Chapter
Speed Indicators for Circuit Optimization
Alexandre Verle, A. Landrault, Philippe Maurine and Nadine Azémard
Lecture Notes in Computer Science, 2005, Volume 3728, Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation, Page 909
- Download PDF (551.6 KB)
Book Chapter
Structural optimization
C. Fleury and B. Fraeijs de Veubeke
Lecture Notes in Computer Science, 1975, Volume 27, Optimization Techniques IFIP Technical Conference Novosibirsk, July 1–7, 1974, Pages 314-326
- Download PDF (592.2 KB)
Book Chapter
Fermi surface properties of Pb₇₁Sn₂₉Te above and below the structural phase transition
Yusheng He and A. D. C. Grassie
Lecture Notes in Physics, 1983, Volume 177, Application of High Magnetic Fields in Semiconductor Physics, Pages 369-373
- Download PDF (215.3 KB)
Book Chapter
A new approach to knock-knee channel routing
Dorothea Wagner
Lecture Notes in Computer Science, 1991, Volume 557, ISA'91 Algorithms, Pages 83-93
- Download PDF (602.1 KB)
Book Chapter
The VLSI layout problem in various embedding models
Michael Formann and Frank Wagner
Lecture Notes in Computer Science, 1991, Volume 484, Graph-Theoretic Concepts in Computer Science, Pages 130-139
- Download PDF (792.0 KB)

Abstract

Let A(n) be the minimum area of convex lattice n-gons. We prove that lim A(n)/n³ exists. Our computations suggest that the value of the limit is very close to 0.0185067....

Mathematics Subject Classification (2000): 52C05

* Partially supported by Hungarian National Science Foundation Grants T 032452 and T 029255.

Fulltext Preview

Image of the first page of the fulltext document

Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us

SpringerLink

The Minimum Area of Convex Lattice n-Gons

View Related Documents

Abstract

Fulltext Preview