A note on finding a maximum empty rectangle (Q1079570)

From MaRDI portal
Revision as of 03:09, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    maximum empty rectangle problem
    0 references