An efficient algorithm to generate random sphere packs in arbitrary domains

DOI10.1016/j.camwa.2016.02.032zbMath1443.68221OpenAlexW2305748903MaRDI QIDQ2007204

Waldemar Celes, Marcelo Gattass, Deane Roehl, Elias Lozano

Publication date: 12 October 2020

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2016.02.032

zbMATH Keywords

sphere packinggeometric algorithmadvancing-front approachdistance-field applications

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

An algorithm to generate dense and stable particle assemblies for 2D DEM simulation ⋮ Single-particle fabric tensors for assemblies of spherical particles

Uses Software

• Qhull

Cites Work

• Unnamed Item
• A fast and practical method to pack spheres for mesh generation
• Packing spherical discrete elements for large scale simulations
• Analysis of a triangulation based approach for specimen generation for discrete element simulations.
• A geometric algorithm based on tetrahedral meshes to generate a dense polydisperse sphere packing
• Geometric properties of random disk packings.
• An algorithm to generate random dense arrangements for discrete element simulations of granular assemblies
• Determining the spatial containment of a point in general polyhedra
• High-density sphere packing for discrete element method simulations
• Geometrical modeling of granular structures in two and three dimensions. Application to nanostructures
• THE FRACTAL DIMENSION OF THE APOLLONIAN SPHERE PACKING
• The quickhull algorithm for convex hulls
• Filling domains with disks: an advancing front approach

This page was built for publication: An efficient algorithm to generate random sphere packs in arbitrary domains