An optimal time and minimal space algorithm for rectangle intersection problems (Q3318126): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Reporting and Counting Geometric Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on “algorithms for reporting and counting geometric intersections” / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposable searching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic range queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for the rectangle enclosure problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for a special case of disjoint set union / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00989481 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971436459 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:49, 30 July 2024

scientific article
Language Label Description Also known as
English
An optimal time and minimal space algorithm for rectangle intersection problems
scientific article

    Statements

    An optimal time and minimal space algorithm for rectangle intersection problems (English)
    0 references
    1984
    0 references
    computational geometry
    0 references
    analysis of algorithms
    0 references
    rectangle intersection
    0 references
    divide-and-conquer
    0 references
    disjoint set union-find
    0 references

    Identifiers