The optimality of a certain purely recursive dissection for a sequentially \(n\)-divisible square

DOI10.1016/S0925-7721(02)00047-0zbMath1013.68268MaRDI QIDQ1869738

Gisaku Nakamura, Akihiro Nozaki, Toshinori Sakai, Jin Akiyama, Ken'ichi Ozawa

Publication date: 28 April 2003

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

purely recursive dissectionsequentially \(n\)-divisible square

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity ⋮ Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday) ⋮ Hinged dissections exist ⋮ Twenty years of progress of \(\mathrm{JCDCG}^3\)

Cites Work

• Simple perfect squared square of lowest order
• Unnamed Item
• Unnamed Item

This page was built for publication: The optimality of a certain purely recursive dissection for a sequentially \(n\)-divisible square