Algorithms and Data Structures

DOI10.1007/11534273MaRDI QIDQ5394251zbMATH OpenOpenAlexFDO

Authors Erik D. Demaine, Martin L. Demaine, Jeffrey F. Lindy, Diane L. Souvaine

Publication date 25 October 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11534273

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Dissections and valuations (Hilbert's third problem, etc.) (52B45)

Recommendations

• Hinged dissection of polyominoes and polyforms
• Hinged dissections exist
• Hinged dissections exist
• Polyhedral characterization of reversible hinged dissections
• A problem on hinged dissections with colours

Cited in

(13)

• Interlocking of convex polyhedra: towards a geometric theory of fragmented solids
• A problem on hinged dissections with colours
• Straight Skeletons of Three-Dimensional Polyhedra
• Hinged dissection of polyominoes and polyforms
• The hinged dodecahedron
• Polyhedral characterization of reversible hinged dissections
• Hinged dissections exist
• Straight skeletons and mitered offsets of nonconvex polytopes
• Hinged dissections exist
• Hinged Frameworks with Unusual Geometrical Properties
• Locked and unlocked chains of planar shapes
• Realistic roofs over a rectilinear polygon
• Folding polyominoes from one level to two

This page was built for publication: Algorithms and Data Structures

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