A new parallel algorithm for constructing Voronoi tessellations from distributed input data

Abstract

We present a new parallel algorithm for generating consistent Voronoi diagrams from distributed input data for the purposes of simulation and visualization. The algorithm functions by building upon any serial Voronoi tessellation algorithm. The output of such a serial tessellator is used to determine the connectivity of the distributed domains without any assumptions about how points are distributed across those domains, and then in turn to build the portion of the global tessellation local to each domain using information from that domains neighbors. The result is a generalized methodology for adding distributed capabilities to serial tessellation packages. Results from several two-dimensional tests are presented, including strong and weak scaling of its current implementation.

Insights from Synthetic Star-forming Regions. I. Reliable Mock Observations from SPH Simulations

“…Therefore, mapping particle-based simulations onto a mesh using a Voronoi mesh 9 is beneficial for our proposes. Note, Mapping SPH simulations onto a 9 The Voronoi tessellation has been recently implemented into Voronoi mesh has also been carried out by Hubber et al (2016), Barcarolo et al (2014), Starinshak et al (2014) and Zhou et al (2007).…”

Tile & Merge: Distributed Delaunay Triangulations for Cloud Computing

“…Generally, algorithms designed for shared memory systems [BBK06], [BMPS10] are more effective due to the relatively fast communication between the PEs via the shared memory. On the other hand, algorithms designed for distributed memory systems [SOJ14] are not bounded by the size of the shared memory but by the total number of PEs, their total available memory or their disk space, which can be extended relatively easily, and therefore they can operate on larger data sets.…”

“…The need to compute the Delaunay triangulation (DT) of extremely large point sets in R d is present across a large variety of application domains, ranging from computer graphics [FLP14], multimedia [TO00], pattern recognition [XY03], fluid simulation [ATW13] and computer vision [HKLP09] to geology [KM09], [WMRL17] and astrophysics [SOJ14].…”

Characterizing high temperature crack growth behaviour under mixed environmental, creep and fatigue conditions

“…Since the creep damage and crack usually was found in the notched region, the generated microstructures were only at this region to save the computational time. An idealized microstructure with random grains and finite thickness grain boundaries has been generated using the Voronoi tessellation technique [36][37][38]. The micro structure model replicates the prior austenite grains structures in of P92 steels.…”