An efficient algorithm for computing the maximum empty rectangle in three dimensions (Q5938672)

From MaRDI portal
Revision as of 21:04, 21 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1630206
Language Label Description Also known as
English
An efficient algorithm for computing the maximum empty rectangle in three dimensions
scientific article; zbMATH DE number 1630206

    Statements

    An efficient algorithm for computing the maximum empty rectangle in three dimensions (English)
    0 references
    0 references
    1 October 2001
    0 references
    computational geometry
    0 references
    maximum empty hyper rectangle
    0 references
    space sweep paradigm
    0 references
    three dimensions
    0 references
    segment-interval tree
    0 references
    expected case complexity
    0 references

    Identifiers