The Decomposition of a Rectangle into Rectangles of Minimal Perimeter
From MaRDI portal
Recommendations
Cited in
(16)- The decomposition of a square into rectangles of minimal perimeter
- Partitioning a rectangle into small perimeter rectangles
- Fast equi-partitioning of rectangular domains using stripe decomposition
- -soft packings of rectangles
- Decompositions of a rectangle into non-congruent rectangles of equal area
- A dual of the rectangle-segmentation problem for binary matrices
- On three soft rectangle packing problems with guillotine constraints
- Exact and approximation algorithms for a soft rectangle packing problem
- scientific article; zbMATH DE number 4016916 (Why is no real title available?)
- Algorithms and Computation
- Close-to-optimal algorithm for rectangular decomposition of 3D shapes.
- PACKING SOFT RECTANGLES
- scientific article; zbMATH DE number 6258433 (Why is no real title available?)
- Nonlocal approximation of the anisotropic perimeter and application to topology optimization
- The structure of rectangle families dividing the plane into maximum number of atoms
- An approximation algorithm for dissecting a rectangle into rectangles with specified areas
This page was built for publication: The Decomposition of a Rectangle into Rectangles of Minimal Perimeter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3812854)