Tiling Polygons with Lattice Triangles

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Given a simple polygon with rational coordinates having one vertex at the origin and an adjacent vertex on the x-axis, we look at the problem of the location of the vertices for a tiling of the polygon using lattice triangles (i. e., triangles which are congruent to a triangle with the coordinates of the vertices being integer). We show that the coordinates of the vertices in any tiling are rationals with the possible denominators odd numbers dependent on the cotangents of the angles in the triangles. © 2010 Springer Science+Business Media, LLC.

Cite

CITATION STYLE

APA

Butler, S., Chung, F., Graham, R., & Laczkovich, M. (2010). Tiling Polygons with Lattice Triangles. Discrete and Computational Geometry, 44(4), 896–903. https://doi.org/10.1007/s00454-010-9249-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free