Abstract
Voronoi diagrams are essential geometrical structures with numerous applications, particularly astrophysics-driven finite volume methods. While serial algorithms for constructing these entities are well-established, parallel construction remains challenging. This is especially true in distributed memory systems, where each host manages only a subset of the input points. This process requires redistributing points across hosts and accurately computing the corresponding Voronoi cells. In this paper, we introduce a new distributed construction algorithm, which is implemented in our open-source C++ 3D Voronoi construction framework. Our approach leverages Delaunay triangulation as an intermediate step, which is then transformed into a Voronoi diagram. We introduce the algorithms we implemented for the precise construction and our load-balancing approach and compare the running time with other state-of-the-art frameworks. Madvoro is a versatile tool that can be applied in various scientific domains, such as mesh decomposition, computational physics, chemistry, and machine learning.
| Original language | English |
|---|---|
| Article number | rzaf039 |
| Journal | RAS Techniques and Instruments |
| Volume | 4 |
| DOIs | |
| State | Published - 2025 |
Bibliographical note
Publisher Copyright:© The Author(s) 2025. Published by Oxford University Press on behalf of Royal Astronomical Society.
Keywords
- Algorithms
- Computational Geometry
- Delaunay Triangulations
- Distributed Computing
- Parallel Computing
- Voronoi Diagrams
Fingerprint
Dive into the research topics of 'madvoro: parallel construction of Voronoi diagrams in distributed memory systems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver