A Data Structure and an Algorithm for the Nearest Point Problem (Q3659157)

From MaRDI portal
Revision as of 10:31, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Data Structure and an Algorithm for the Nearest Point Problem
scientific article

    Statements

    title
    A Data Structure and an Algorithm for the Nearest Point Problem (English)
    0 references
    author
    Iraj Kalantari
    0 references
    Gerard McDonald
    0 references
    publication date
    1983
    0 references
    zbMATH Keywords
    tree structure
    0 references
    nearest point
    0 references
    storage binary search
    0 references

    Identifiers

    zbMATH DE Number
    3810940
    0 references
    Wikidata QID
    Q111898988
    0 references
    OpenAlex ID
    W2091967195
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3659157&oldid=37294639"
    Powered by MediaWiki