Hinged Kite Mirror Dissection
| dc.creator | Eppstein, David | |
| dc.date | 2001-06-13 | |
| dc.date.accessioned | 2026-07-07T03:17:15Z | |
| dc.date.available | 2026-07-07T03:17:15Z | |
| dc.description | Any two polygons of equal area can be partitioned into congruent sets of polygonal pieces, and in many cases one can connect the pieces by flexible hinges while still allowing the connected set to form both polygons. However it is open whether such a hinged dissection always exists. We solve a special case of this problem, by showing that any asymmetric polygon always has a hinged dissection to its mirror image. Our dissection forms a chain of kite-shaped pieces, found by a circle-packing algorithm for quadrilateral mesh generation. A hinged mirror dissection of a polygon with n sides can be formed with O(n) kites in O(n log n) time. | |
| dc.description | 8 pages, 7 figures | |
| dc.identifier | https://arxiv.org/abs/cs/0106032 | |
| dc.identifier | http://arxiv.org/abs/cs/0106032 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30652 | |
| dc.subject | Computational Geometry | |
| dc.subject | Metric Geometry | |
| dc.subject | F.2.2 | |
| dc.title | Hinged Kite Mirror Dissection | |
| dc.type | text |