The optimality of a certain purely recursive dissection for a sequentially \(n\)-divisible square
From MaRDI portal
Publication:1869738
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)
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
This page was built for publication: The optimality of a certain purely recursive dissection for a sequentially \(n\)-divisible square