Sequentially divisible dissections of simple polygons

DOI10.1007/3-540-47738-1_4MaRDI QIDQ4547791zbMATH OpenFDO

Authors Jin Akiyama, J. Urrutia, Toshinori Sakai

Publication date 21 August 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2098/20980053

zbMATH Keywords

convex \(n\)-gonregular polygonssequentially \(k\)-divisible dissectionstar shaped polygons

Mathematics Subject Classification ID

Dissections and valuations (Hilbert's third problem, etc.) (52B45)

Recommendations

• \((1+n)\) sequential dissection of a rectangle into \(m\)-gons, \(m\in \{ 3,5,6,7,8 \}\)
• Equidissections of polygons
• Efficient regular polygon dissections
• Dissections of polygons into convex polygons
• Efficient regular polygon dissections

Cited in

(12)

• The optimality of a certain purely recursive dissection for a sequentially n-divisible square
• Cutting sequences, regular polygons, and the Veech group
• Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday)
• Polygonal dissections and reversions of series
• \((1+n)\) sequential dissection of a rectangle into \(m\)-gons, \(m\in \{ 3,5,6,7,8 \}\)
• Touring a sequence of disjoint polygons: complexity and extension
• Complete dissections: converting regions and their boundaries
• Efficient regular polygon dissections
• A note on the purely recursive dissection for a sequentially n-divisible square
• scientific article; zbMATH DE number 943337 (Why is no real title available?)
• scientific article; zbMATH DE number 4121493 (Why is no real title available?)
• Polygon dissections complexes are shellable

This page was built for publication: Sequentially divisible dissections of simple polygons

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