K. Nesenbergs. Equilateral Monogonal Tessellation of Arbitrary Polygons-a Recursive Algorithm. Malaysian Journal of Mathematical Sciences, 13(), 51 - 64 pp. 2019.
Bibtex citāts:
Bibtex citāts:
@article{10242_2019,
author = {K. Nesenbergs},
title = {Equilateral Monogonal Tessellation of Arbitrary Polygons-a Recursive Algorithm},
journal = {Malaysian Journal of Mathematical Sciences},
volume = {13},
pages = {51 - 64},
year = {2019}
}
author = {K. Nesenbergs},
title = {Equilateral Monogonal Tessellation of Arbitrary Polygons-a Recursive Algorithm},
journal = {Malaysian Journal of Mathematical Sciences},
volume = {13},
pages = {51 - 64},
year = {2019}
}
Anotācija: Tessellation or tiling can be useful in multiple domains, such as computer graphics, physics, architecture etc. In this article the tessellation problem is explored and a recursive algorithm is proposed, implemented and validated for generating equilateral monogonal tessellations (including all semi-regular tessellations) in two dimensions inside any arbitrary simple polygon
Pilnais teksts: Equilateral Monogonal Tessellation