How hard is half-space range searching? (Q685178)

From MaRDI portal
Revision as of 09:58, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
How hard is half-space range searching?
scientific article

    Statements

    title
    How hard is half-space range searching? (English)
    0 references
    author
    Hervé Brönnimann
    0 references
    János Pach
    0 references
    Bernard Chazelle
    0 references
    publication date
    30 September 1993
    0 references
    zbMATH Keywords
    range searching
    0 references
    lower bounds
    0 references
    cites work
    Q3219753
    0 references
    Q4110292
    0 references
    Q3481743
    0 references
    Polygon Retrieval
    0 references

    Identifiers

    DOI
    10.1007/BF02573971
    0 references
    zbMATH DE Number
    417111
    0 references
    Wikidata QID
    Q29394177
    0 references
    OpenAlex ID
    W1995232397
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q685178&oldid=37187697"
    Powered by MediaWiki