Hostname: page-component-7479d7b7d-767nl Total loading time: 0 Render date: 2024-07-14T18:11:37.191Z Has data issue: false hasContentIssue false

Integer geometry: some examples and constructions

Published online by Cambridge University Press:  01 August 2016

Blake E. Peterson
Affiliation:
Department of Mathematics, Brigham Young University, Provo, UT 84602, USA
James H. Jordan
Affiliation:
Washington State University, Department of Mathematics, Pullman, WA 99164-3113, USA

Extract

Integer Geometry is the geometry of points that are pairwise integer distances apart. An integer polygon is a convex set of n points in the plane such that no three points are collinear and the distance between any two points is an integer. Similarly an integer polyhedron is a convex set of n points in space such that no three are collinear, each face is an integer polygon, no two faces are coplaner, and the points are all integer distances apart. The measure used to order such polygons and polyhedra is perimeter-plus which is the sum of all of the edges added to the sum of all of the diagonals [1]. The purpose of this paper is to provide pictures of some fundamental examples as well as a brief explanation of some of the constructions. We begin by looking at polygons and then use those to build polyhedra and conclude by examining two closely related examples of sixfaced polyhedra.

Type
Articles
Copyright
Copyright © The Mathematical Association 1997

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Peterson, Blake E., Integer polyhedra, Dissertation (unpublished), Washington State University (1993).Google Scholar
2. Harborth, H. and Kemnitz, A., Diameters of integer point sets, Colloq. Math. Soc. János Bolyai 48. Intuitive Geometry, Siofok (1985).Google Scholar
3. Müller, A., Auf einen Kreis liegende Punktmengen ganzzahliger Entfenungen, Elem. der Math. 8 (1953) pp. 3738.Google Scholar
4. Harborth, H. and Piepmeyer, L., Points sets with small integral distances, DIMACS 4, (1991) pp. 319324.Google Scholar
5. Möller, Meinhard, Dissertation (unpublished), Technischen Universität Carolo-Wilhelmina zu Brauschweig (1990).Google Scholar
6. Klee, V. and Wagon, S., Old and new unsolved problems in plane geometry and number theory, MAA (1991).Google Scholar
7. Korec, Ivan, Nonexistence of a small perfect rational cuboid, Acta Math. Univ. Contenian, 42–43 (1983) pp. 7386.Google Scholar
8. Korec, Ivan, Nonexistence of a small perfect rational cuboid, II, Acta Math. Univ. Comenian, 44–45 (1984) pp. 3948.Google Scholar
9. Leech, John, The rational cuboid revisited, Amer. Math. Monthly, 84 (1977) pp. 518533.CrossRefGoogle Scholar
10. Guy, Richard K., Unsolved problems in number theory, Springer Verlag, (1985).Google Scholar
11. Peterson, Blake E. and Jordan, James H., Integer hexahedra equivalent to a perfect box, Amer. Math. Monthly, 102 (1), January 1995, pp. 4145.Google Scholar