A nearest neighbor sweep circle algorithm for computing discrete Voronoi tessellations (Q2381920): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jmaa.2007.03.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2014433593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cellular Automata Modeling of Physical Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational geometry algorithms for the systolic screen / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nöther and Riemann-Roch type theorems for piecewise algebraic curve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computation of discrete Voronoi diagrams / rank
 
Normal rank

Latest revision as of 09:16, 27 June 2024

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
    Voronoi diagram
    0 references
    discrete Voronoi diagram
    0 references

    Identifiers