Overlap Dimensions in Cyclic Tessellable Regular Polygons
Elvis Kobina Donkoh, Samuel Kwame Amponsah, Alex Akwasi Opoku · Research Journal of Mathematics and Statistics · 2015
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.