A fast robust algorithm for computing discrete Voronoi diagrams (Q846176): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Dave A. May / rank
Normal rank
 
Property / author
 
Property / author: Dave A. May / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57858952 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: V-Clip / rank
 
Normal rank
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.1007/s10852-008-9097-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2045729041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian integration point finite element method for large deformation modeling of viscoelastic geomaterials. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid cellular automaton/neural network classifier for multi-valued patterns and its VLSI implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapid and accurate computation of the distance function using grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for approximating distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi-like partition of lattice in cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi-like nondeterministic partition of a lattice by collectives of finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4361347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Voronoi Diagrams of Convex Sites in Any Dimension / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:05, 2 July 2024

scientific article
Language Label Description Also known as
English
A fast robust algorithm for computing discrete Voronoi diagrams
scientific article

    Statements

    A fast robust algorithm for computing discrete Voronoi diagrams (English)
    0 references
    0 references
    0 references
    0 references
    1 February 2010
    0 references
    0 references
    discrete Voronoi
    0 references
    particle-in-cell
    0 references
    FEM
    0 references
    quadrature
    0 references
    0 references
    0 references
    0 references
    0 references