An approximation algorithm for dissecting a rectangle into rectangles with specified areas

DOI10.1016/J.DAM.2006.08.005zbMATH Open1107.68122OpenAlexW2014953934MaRDI QIDQ869574FDOQ869574

Authors: Hiroshi Nagamochi, Yuusuke Abe 

Publication date: 8 March 2007

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

Full work available at URL: https://doi.org/10.1016/j.dam.2006.08.005

Recommendations

• Algorithms and Computation
• The Decomposition of a Rectangle into Rectangles of Minimal Perimeter
• Partitioning a square into rectangles: NP-Completeness and approximation algorithms
• On three soft rectangle packing problems with guillotine constraints
• Partitioning a rectangle into small perimeter rectangles

zbMATH Keywords

approximation algorithmNP-hardrectangledivide-and-conquerfacility layoutaspect ratiodissectionfloor plan

Mathematics Subject Classification ID

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

Cites Work

• Optimal orientations of cells in slicing floorplan designs
• Title not available (Why is that?)
• A new mathematical-programming framework for facility-layout design
• Improved bounds for rectangular and guillotine partitions
• Title not available (Why is that?)
• Title not available (Why is that?)
• The decomposition of a square into rectangles of minimal perimeter
• The Decomposition of a Rectangle into Rectangles of Minimal Perimeter
• Partitioning a square into rectangles: NP-Completeness and approximation algorithms
• On optimal guillotine partitions approximating optimal \(d\)-box partitions
• Tiling a rectangle with the fewest squares
• Title not available (Why is that?)

Cited In (9)

• A modified DIviding RECTangles algorithm for a problem in astrophysics
• \(\gamma\)-soft packings of rectangles
• Algorithms and Computation
• The Decomposition of a Rectangle into Rectangles of Minimal Perimeter
• An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules
• Exact and approximation algorithms for a soft rectangle packing problem
• Rectangle transformation problem
• On three soft rectangle packing problems with guillotine constraints
• Approximation algorithms for partitioning a rectangle with interior points

This page was built for publication: An approximation algorithm for dissecting a rectangle into rectangles with specified areas

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