A problem on hinged dissections with colours

DOI10.1007/S00373-003-0546-8MaRDI QIDQ1889823zbMATH OpenOpenAlexFDO

Authors Jin Akiyama, J. Urrutia, Ferran Hurtado, Criel Merino

Publication date 13 December 2004

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-003-0546-8

zbMATH Keywords

motion planninghinged dissection

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of tessellation and tiling problems (05B45) Dissections and valuations (Hilbert's third problem, etc.) (52B45)

Recommendations

• Hinged dissection of polyominoes and polyforms
• Hinged dissections exist
• Hinged dissections exist
• Congruent Dudeney dissections of polygons. All the hinge points on vertices of the polygon.
• Algorithms and Data Structures

Cited in

(4)

• Hinged dissection of polyominoes and polyforms
• Congruent Dudeney dissections of polygons. All the hinge points on vertices of the polygon.
• Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday)
• Algorithms and Data Structures

This page was built for publication: A problem on hinged dissections with colours

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1889823)