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

Computational Geometry - Tập 24 - Trang 27-39 - 2003
Jin Akiyama1, Gisaku Nakamura1, Akihiro Nozaki2, Ken'ichi Ozawa3, Toshinori Sakai1
1Research Institute of Educational Development, Tokai University, 2-28-4 Tomigaya, Shibuya-ku, Tokyo 151-0063, Japan
2School of Social Information Studies, Otsuma Women's University, 2-7-1 Karakida, Tama-shi, Tokyo 206-8540, Japan
3Higashino High School, 112-1 Nihongi, Iruma-shi, Saitama 358-8558, Japan

Tài liệu tham khảo

Akiyama, 1997, An efficient dissection for a sequentially n-divisible square, 80 Akiyama, 2001, A note on the purely recursive dissection for a sequentially n-divisible square, 2098, 41 Busschop, 1876, Problèmes de géométrie, Nouvelle Correspondance Mathématique, 2, 83 Duijvestijn, 1978, Simple perfect squared square of lowest order, J. Combin. Theory Ser. B, 25, 240, 10.1016/0095-8956(78)90041-2 Frederickson, 1997 Nozaki, 1999, On the dissection of a square into squares, Suugaku-Seminar, 12, 52 Ozawa, 1988, Entertainer in a classroom, Suugaku-Seminar, 10 K. Ozawa, Private communication, 1999 Perigal, 1873, On geometric dissections and transformations, Messenger of Mathematics, 2, 103 Thābit ibn Qurra, Risāla fi'l-hujja al-mansūba ilā Suqrāt fi'l-murabba wa qutrihi