A note on finding a maximum empty rectangle
type: Item
instance of: scholarly article
title: A note on finding a maximum empty rectangle
zbMATH Open document ID: 0598.05018
DOI: 10.1016/0166-218X(86)90071-5
author: Mikhail J. Atallah
author: Greg N. Frederickson
published in: Discrete Applied Mathematics
publication date: 1986-01-01T00:00:00Z
review text: Given a rectangle A and a set S of n points in A, the maximum empty rectangle problem is that of finding a largest-area rectangle which is contained in A, has its sides parallel to those of A, and does not contain any of the points in S. This note describes an efficient algorithm for solving this problem.
Mathematics Subject Classification ID: 05B25
Mathematics Subject Classification ID: 68R99
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3963846
zbMATH Keywords: maximum empty rectangle problem
MaRDI profile type: Publication
cites work: Q3217615
cites work: On the maximum empty rectangle problem
cites work: Maintenance of configurations in the plane
description: scientific article; zbMATH DE number 3963846