Abstract
Circles are frequently used for modelling the growth of particle aggregates through the Voronoi diagram of circles, that is a special instance of the Johnson-Mehl tessellation. The Voronoi diagram of a set
of sites is a decomposition of space into proximal regions. The proximal region of a site is the locus of points closer to that site than to any other one. Voronoi diagrams allow one to answer proximity queries after locating a query point in the Voronoi zone it belongs to. The dual graph of the Voronoi diagram is called the Delaunay graph. In this paper, we first show a necessary and sufficient condition of connectivity of the Voronoi
diagram of circles. Then, we show how the Delaunay graph of circles (the dual graph of the Voronoi diagram of circles) can be computed exactly, and in a much simpler way, by computing the eigenvalues of a two by two matrix. Finally, we present how the Voronoi diagram of circles can
be used to model the growth of particle aggregates. We use the Poisson point process in the Voronoi diagram of circles to generate the Johnson-Mehl tesselation. The Johnson-Mehl model is a Poisson Voronoi growth model, in which nuclei are generated asynchronously using a Poisson
point process, and grow at the same radial speed. Growth models produce spatial patterns as a result of simple growth processes and their visualization is important in many technical processes.
Original language | English |
---|---|
Journal | Transactions on Computational Science |
Pages (from-to) | 20-54 |
DOIs | |
Publication status | Published - 2009 |
Bibliographical note
Further details after publicationKeywords
- Visualization of nucleation and growth of particles
- Gröbner bases
- growth models
- Voronoi diagram of circles
- Johnson-Mehl tessellations