Orthogonal dissection into few rectangles

DOI10.1007/s00454-023-00614-wMaRDI QIDQ6662769

David Eppstein

Publication date: 14 January 2025

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

zbMATH Keywords

tensor rankDehn invariantorthogonal polygonsdissection

Mathematics Subject Classification ID

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

Cites Work

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

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