A nearest neighbor sweep circle algorithm for computing discrete Voronoi tessellations (Q2381920)

From MaRDI portal
Revision as of 10:16, 27 June 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
A nearest neighbor sweep circle algorithm for computing discrete Voronoi tessellations
scientific article

    Statements

    A nearest neighbor sweep circle algorithm for computing discrete Voronoi tessellations (English)
    0 references
    0 references
    26 September 2007
    0 references
    0 references
    Voronoi diagram
    0 references
    discrete Voronoi diagram
    0 references
    0 references