Using mathematical tessellation to model spherical particle packing structures
type: Item
instance of: scholarly article
zbMATH Open document ID: 1343.05047
author: Larysa Burtseva
author: Frank Werner
publication date: 2016-05-30T00:00:00Z
Mathematics Subject Classification ID: 05B45
Mathematics Subject Classification ID: 05B40
Mathematics Subject Classification ID: 52B05
zbMATH DE Number: 6587501
zbMATH Keywords: tesselation
zbMATH Keywords: Voronoi diagram
zbMATH Keywords: Delaunay simplex
zbMATH Keywords: Laguerre geometry
zbMATH Keywords: sphere packing
zbMATH Keywords: structure modeling
MaRDI profile type: MaRDI publication profile
title: Using mathematical tessellation to model spherical particle packing structures
published in: International Journal of Mathematics, Game Theory and Algebra
review text: The paper reviews principal tesselation methods wih respect to Voronoi diagrams, defined as follows. Given a finite set of points (also called sites or generators) in the space, the Voronoi cell of a site is the polygon (or polyhedron) consisting of the set of points of the space closer to that site than to any other. The resulting partition of the space is a Voronoi diagram. Furthermore, a Delaunay triangulation of the space, dual to the Voronoi diagram, is obtained by joining by a straight line two sites in neighboring Voronoi cells. One can generalize Voronoi diagrams by replacing sites by circles (or spheres) and using other distances than the Euclidean distance (Laguerre geometry). The authors discuss the several approaches, illustrate them with applications to model spherical particle packings and provide a great variety of references.
reviewed by: Benoît Loridant
description: scientific article; zbMATH DE number 6587501