Using mathematical tessellation to model spherical particle packing structures
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.
- Random packing and tessellation network on the sphere
- scientific article; zbMATH DE number 1728321 (Why is no real title available?)
- Fitting spherical Laguerre Voronoi diagrams to real-world tessellations using planar photographic images
- On the structural properties of Voronoi diagrams
- PREDICTION OF THE EXTREMAL SHAPE FACTOR OF SPHEROIDAL PARTICLES
- scientific article; zbMATH DE number 1463879 (Why is no real title available?)
- scientific article; zbMATH DE number 2088188 (Why is no real title available?)
This page was built for publication: Using mathematical tessellation to model spherical particle packing structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2809765)