Optimal partition trees (Q420575)

From MaRDI portal
Revision as of 06:49, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Optimal partition trees
scientific article

    Statements

    title
    Optimal partition trees (English)
    0 references
    author
    Timothy M. Chan
    0 references
    publication date
    22 May 2012
    0 references
    zbMATH Keywords
    simplex range searching
    0 references
    halfspace range searching
    0 references
    geometric data structures
    0 references
    cites work
    Q4633824
    0 references
    Q3997899
    0 references
    Q4225298
    0 references
    Q2913806
    0 references
    Q4530626
    0 references
    Q4856179
    0 references
    Q3992847
    0 references
    Polygon Retrieval
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68U05
    0 references
    05C05
    0 references
    68Q25
    0 references
    68P05
    0 references
    68P10
    0 references
    52C35
    0 references
    zbMATH DE Number
    6037505
    0 references
    OpenAlex ID
    W4253015087
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q420575&oldid=35280504"
    Powered by MediaWiki