Efficient algorithms for the largest rectangle problem

DOI10.1016/0020-0255(92)90115-OzbMath0792.68057OpenAlexW2026555584MaRDI QIDQ1193696

Amitava Datta

Publication date: 27 September 1992

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(92)90115-o

zbMATH Keywords

bounding isothetic rectanglelargest rectangle problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (6)

On the largest empty axis-parallel box amidst \(n\) points ⋮ An efficient algorithm for computing the maximum empty rectangle in three dimensions ⋮ Fast parallel algorithms for the maximum empty rectangle problem. ⋮ Maximal Empty Boxes Amidst Random Points ⋮ Maximal strips data structure to represent free space on partially reconfigurable FPGAs ⋮ An optimal algorithm for rectangle placement

Cites Work

• On the maximum empty rectangle problem
• A note on finding a maximum empty rectangle
• Geometric applications of a matrix-searching algorithm
• An efficient algorithm for maxdominance, with applications
• Computing the Largest Empty Rectangle
• On rectangular visibility
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient algorithms for the largest rectangle problem