Efficient regular polygon dissections
From MaRDI portal
Publication:1573694
DOI10.1023/A:1005292125553zbMath0956.68115OpenAlexW48700190MaRDI QIDQ1573694
Jorge Urrutia, Evangelos Kranakis, Danny Krizanc
Publication date: 23 October 2000
Published in: Geometriae Dedicata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1005292125553
Computational aspects related to convexity (52B55) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Dissections and valuations (Hilbert's third problem, etc.) (52B45)
Related Items
Decompositions of a polygon into centrally symmetric pieces ⋮ Hinged dissections exist ⋮ Hinged dissection of polyominoes and polyforms
