Orthogonal dissection into few rectangles

DOI10.1007/S00454-023-00614-WMaRDI QIDQ6662769zbMATH OpenFDO

Authors David Eppstein

Publication date 14 January 2025

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00454-023-00614-W

zbMATH Keywords

Dehn invariantdissectionorthogonal polygonstensor rank

Mathematics Subject Classification ID

Dissections and valuations (Hilbert's third problem, etc.) (52B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles
• Dissection with the fewest pieces is hard, even to approximate
• scientific article; zbMATH DE number 1507298
• Efficient regular polygon dissections
• Rectangular partitions of a rectilinear polygon

Cites work

• \textit{Wallace'}s theorem concerning plane polygons of the same area.
• A dual of the rectangle-segmentation problem for binary matrices
• A New Approach to Hilbert's Third Problem
• Conditions necessaires et suffisantes pour l'équivalence des polyedres de l'espace euclidien à trois dimensions
• Dissecting Cuboids into Cuboids
• Efficient binary space partitions for hidden-surface removal and solid modeling
• Exact geometric and algebraic computations in CGAL
• Graph-Theoretic Solutions to Computational Geometry Problems
• scientific article; zbMATH DE number 1639663 (Why is no real title available?)
• scientific article; zbMATH DE number 3700274 (Why is no real title available?)
• scientific article; zbMATH DE number 45409 (Why is no real title available?)
• scientific article; zbMATH DE number 1229395 (Why is no real title available?)
• Minimal rectangular partitions of digitized blobs
• Optimal matrix-segmentation by rectangles
• Scissors congruences, group homology and characteristic classes
• The Algebra of Polyhedra and the Dehn-Sydler Theorem.
• Zerschneidung jeder beliebigen Anzahl von gleichen geradlinigen Figuren in dieselben Stücke.
• Über den Rauminhalt.
• Über Zerlegung von Rechtecken in Rechtecke.

This page was built for publication: Orthogonal dissection into few rectangles

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