Abstract
We study the minimum number g(m, n) (respectively, p(m, n)) of pieces needed to dissect a regular m-gon into a regular n-gon of the same area using glass-cuts (respectively, polygonal cuts). First we study regular polygon-square dissections and show that [n/2] - 2 < g(4, n) < g(n, 4) < p(4, n) < £ +o(n), holds for sufficiently large n. We also consider regular polygon-polygon dissections and obtain similar bounds for g(m, n) and p(m, n).
Author supplied keywords
Cite
CITATION STYLE
Kranakis, E., Krizanc, D., & Urrutia, J. (2000). Efficient regular polygon dissections. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1763, pp. 172–187). Springer Verlag. https://doi.org/10.1007/978-3-540-46515-7_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
