Efficient \(c\)-oriented range searching with DOP-trees (Q1000927): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Box-trees and R-trees with near-optimal query time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4225298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate range searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On R-trees with low query complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient partition trees / rank
 
Normal rank

Latest revision as of 01:08, 29 June 2024

scientific article
Language Label Description Also known as
English
Efficient \(c\)-oriented range searching with DOP-trees
scientific article

    Statements

    Efficient \(c\)-oriented range searching with DOP-trees (English)
    0 references
    0 references
    0 references
    0 references
    12 February 2009
    0 references
    geometric data structures
    0 references
    bounding-volume hierarchies
    0 references
    range searching
    0 references

    Identifiers