Accéder directement au contenu Accéder directement à la navigation
Article dans une revue

A simple and fast algorithm for computing discrete Voronoi, Johnson-Mehl or Laguerre diagrams of points

Abstract : This article presents an algorithm to compute digital images of Voronoi, Johnson-Mehl or Laguerre diagrams of a set of punctual sites, in a domain of a Euclidean space of any dimension. The principle of the algorithm is, in a first step, to investigate the voxels in balls centred around the sites, and, in a second step, to process the voxels remaining outside the balls. The optimal choice of ball radii can be determined analytically or numerically, which allows a performance of the algorithm in O(N v lnN s ), where N v is the total number of voxels of the domain and N s the number of sites of the tessellation. Periodic and non-periodic boundary conditions are considered. A major advantage of the algorithm is its simplicity which makes it very easy to implement. This makes the algorithm suitable for creating high resolution images of microstructures containing a large number of cells, in particular when calculations using FFT-based homogenisation methods are then to be applied to the simulated materials.
Type de document :
Article dans une revue
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-03522759
Contributeur : Hervé Moulinec Connectez-vous pour contacter le contributeur
Soumis le : mardi 31 mai 2022 - 14:51:01
Dernière modification le : jeudi 9 juin 2022 - 03:37:05

Fichier

 Accès restreint
Fichier visible le : 2023-08-01

Connectez-vous pour demander l'accès au fichier

Identifiants

Citation

Hervé Moulinec. A simple and fast algorithm for computing discrete Voronoi, Johnson-Mehl or Laguerre diagrams of points. Advances in Engineering Software, Elsevier, 2022, ⟨10.1016/j.advengsoft.2022.103150⟩. ⟨hal-03522759v2⟩

Partager

Métriques

Consultations de la notice

57