Computing closest and farthest points for a query segment (Q2481974)

From MaRDI portal
Revision as of 04:49, 5 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing closest and farthest points for a query segment
scientific article

    Statements

    Computing closest and farthest points for a query segment (English)
    0 references
    0 references
    0 references
    15 April 2008
    0 references
    0 references
    computational geometry
    0 references
    data structure
    0 references
    segment dragging problem
    0 references