Abstract

In this study we study overlap dimensions in cyclic tessellable regular polygons. Overlap difference and area created by tessellable regular polygons inscribed in disks for covering play a significant role in computational geometry and signal interference in telecommunication network design. Regular triangles and squares are no exceptions except for optimality. We propose general formulae for computing the dimensions of a regular polygon inscribed in a disk. The study also leads to formulae for computing the overlap difference of tessellable regular polygons in disk covering. We realize that the cyclic regular hexagon has both optimal covering area and minimal overlap difference of 17.3 and 86.6% reduction over the original 100% disks size, respectively.

Keywords:

Equilateral triangle and disks, hexagons overlap difference, squares,

References

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.