Efficient algorithms for the largest rectangle problem
type: Item
instance of: scholarly article
title: Efficient algorithms for the largest rectangle problem
zbMATH Open document ID: 0792.68057
DOI: 10.1016/0020-0255(92)90115-O
author: Amitava Datta
published in: Information Sciences
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 64991
zbMATH Keywords: largest rectangle problem
zbMATH Keywords: bounding isothetic rectangle
MaRDI profile type: Publication
cites work: Geometric applications of a matrix-searching algorithm
cites work: A note on finding a maximum empty rectangle
cites work: An efficient algorithm for maxdominance, with applications
cites work: Computing the Largest Empty Rectangle
cites work: On the maximum empty rectangle problem
cites work: On rectangular visibility
cites work: Q3694703
cites work: Q3326832
full work available at URL: 0020-0255(92)90115-o
OpenAlex ID: W2026555584
Recommended article: A new algorithm for the largest empty rectangle problem
Recommended article: Faster algorithms for largest empty rectangles and boxes
Recommended article: Fast sequential and parallel algorithms for finding the largest rectangle separating two sets
Recommended article: Algorithms for Rectangular Covering Problems
Recommended article: An efficient algorithm for computing the maximum empty rectangle in three dimensions
Recommended article: Finding largest rectangles in convex polygons
Recommended article: Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
Recommended article: An optimal algorithm for rectangle placement
Recommended article: Q5467815
description: scientific article; zbMATH DE number 64991