A note on finding a maximum empty rectangle (Q1079570): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3217615 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the maximum empty rectangle problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maintenance of configurations in the plane / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:19, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on finding a maximum empty rectangle |
scientific article |
Statements
A note on finding a maximum empty rectangle (English)
0 references
1986
0 references
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.
0 references
maximum empty rectangle problem
0 references
