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

DOI10.1016/S0925-7721(02)00047-0zbMATH Open1013.68268MaRDI QIDQ1869738FDOQ1869738

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

Publication date: 28 April 2003

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

Recommendations

• scientific article; zbMATH DE number 1786498
• A master theorem for discrete divide and conquer recurrences
• A master theorem for discrete divide and conquer recurrences
• Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence
• Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences
• scientific article; zbMATH DE number 7647200
• Multidimensional Divide-and-Conquer Maximin Recurrences
• A computational substantiation of the \(d\)-step approach to the number of distinct squares problem
• scientific article; zbMATH DE number 1786499
• scientific article; zbMATH DE number 1294372

zbMATH Keywords

purely recursive dissectionsequentially \(n\)-divisible square

Mathematics Subject Classification ID

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

Cites Work

• Simple perfect squared square of lowest order
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

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

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

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