There is no perfect Mondrian partition for squares of side lengths less than 1001

DOI10.1016/J.DAM.2024.09.021MaRDI QIDQ6633555

Natalia García-Colín, Mia Müßig, Dimitri Leemans, Érika Roldán

Publication date: 6 November 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

tessellationsMondrian problem

Mathematics Subject Classification ID

Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Computational methods for problems pertaining to convex and discrete geometry (52-08)

Cites Work

• Decompositions of a rectangle into non-congruent rectangles of equal area
• The dissection of rectangles into squares.
• New results for the Mondrian art problem
• The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
• Stochastic Geometry to Generalize the Mondrian Process
• AMF: Aggregated Mondrian Forests for Online Learning
• Tessellation-valued processes that are generated by cell division

This page was built for publication: There is no perfect Mondrian partition for squares of side lengths less than 1001

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