A new parallel algorithm for constructing Voronoi tessellations from distributed input data (Q525736): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q124613075, #quickstatements; #temporary_batch_1711574657256
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4484914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sweepline algorithm for Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reale: a Reconnection-based Arbitrary-Lagrangian-Eulerian method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nearly optimal deterministic parallel Voronoi diagram algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and implementation of a practical parallel Delaunay algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Delaunay mesh generation kernel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point-centered domain decomposition for parallel molecular dynamics simulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Centroidal Voronoi Tessellations: Applications and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Mesh Geometry and Stiffness Matrix Conditioning for General Finite Element Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least squares quantization in PCM / rank
 
Normal rank

Revision as of 18:14, 13 July 2024

scientific article
Language Label Description Also known as
English
A new parallel algorithm for constructing Voronoi tessellations from distributed input data
scientific article

    Statements

    Identifiers