Analysis of the worst case space complexity of a PR quadtree (Q1318753): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(94)90065-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093745429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expected and worst-case storage requirements for quadtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal boundary to quadtree conversion algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor finding techniques for images represented by quadtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time distance transforms for quadtrees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:22, 22 May 2024

scientific article
Language Label Description Also known as
English
Analysis of the worst case space complexity of a PR quadtree
scientific article

    Statements

    Analysis of the worst case space complexity of a PR quadtree (English)
    0 references
    0 references
    0 references
    5 April 1994
    0 references
    spatial data structures
    0 references
    worst case analysis
    0 references
    point data
    0 references
    hierarchical data structures
    0 references
    PR quadtree
    0 references

    Identifiers