An efficient algorithm for computing the maximum empty rectangle in three dimensions (Q5938672): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A note on finding a maximum empty rectangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for maxdominance, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Average Number of Maxima in a Set of Vectors and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Largest Empty Rectangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the largest rectangle problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for direct enclosures and direct dominances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct dominance of points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum empty rectangle problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for the largest empty rectangle problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank

Revision as of 18:09, 3 June 2024

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