Abstract
It is well-known that a regular n-gon can be embedded in the unit lattice of ℝm if and only if m ≥ 2 and n = 4; or m ≥ 3 and n = 3 or 6. In this paper we consider equilateral polygons that can be embedded in the unit lattice of ℝk. These are called lattice equilateral polygons. We show that for any ε > 0, there exists a lattice equilateral 2n-gon in ℝ2 such that the difference between the values of the maximum internal angle and the minimum internal angle is less than ε. We also show a similar result for lattice equilateral 3n-gons in ℝ3 and other related results.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chrestenson, H.E., Klamkin, M.S.: Polygon imbedded in a lattice. Am. Math. Monthly 70, 447–448 (1963)
Scherrer, W.: Die Einlagerung eines regularen Vielecks in ein Gitter. Elemente der Math. 1, 97–98 (1946)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sakai, T. (2000). Embeddings of Equilateral Polygons in Unit Lattices. In: Akiyama, J., Kano, M., Urabe, M. (eds) Discrete and Computational Geometry. JCDCG 1998. Lecture Notes in Computer Science, vol 1763. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46515-7_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-46515-7_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67181-7
Online ISBN: 978-3-540-46515-7
eBook Packages: Springer Book Archive