Malaysian Journal of Mathematical Sciences, December 2019, Vol. 13(S)
Special Issue: Conference on Mathematics, Informatics and Statistics (CMIS2018)


Equilateral Monogonal Tessellation of Arbitrary Polygons - A Recursive Algorithm

Nesenbergs, K.

Corresponding Email: krisjanis.nesenbergs@edi.lv

Received date: -
Accepted date: -

Abstract:
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.

Keywords: Computational geometry, Equilateral tessellation, Monogonal tiling and Recursive algorithm

  



Indexing



















SCImago Journal & Country Rank

Flag Counter