In the paper under review, the authors consider the problem of tiling with lattice triangles a simple polygon which is placed in the plane where one vertex is at the origin and an adjacent vertex on the \(x\)-axis. The main result is that the coordinates of the vertices in any tiling of those polygons are rational with some additional restricted conditions. One thing the reviewer wants to remark is that there have been many results on this problem using similar triangles, but in this paper, the authors use lattice triangles.
Recommendations
Cites work
Cited in
(10)- Tilings of convex polygons
- Triangular covers of a digital object
- Tilings of triangles
- Tilings of regular pentagons with similar right triangles
- A note on area of lattice polygons in an Archimedean tiling
- scientific article; zbMATH DE number 3909236 (Why is no real title available?)
- Tilings of parallelograms with similar right triangles
- Tiling a strip with triangles
- A combinatorial technique for construction of triangular covers of digital objects
- Tiling lattices with sublattices. I
This page was built for publication: Tiling polygons with lattice triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q603872)
