A simple, faster method for kinetic proximity problems (Q2344057)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A simple, faster method for kinetic proximity problems
scientific article

    Statements

    A simple, faster method for kinetic proximity problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    12 May 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    kinetic data structure
    0 references
    all nearest neighbors
    0 references
    closest pair
    0 references
    Euclidean minimum spanning tree
    0 references
    (semi-)Yao graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references