An efficient algorithm to generate random sphere packs in arbitrary domains
type: Item
instance of: scholarly article
title: An efficient algorithm to generate random sphere packs in arbitrary domains
zbMATH Open document ID: 1443.68221
author: Elias Lozano
author: Deane Roehl
author: Waldemar Celes
author: Marcelo Gattass
publication date: 2020-10-12T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 7259730
zbMATH Keywords: sphere packing
zbMATH Keywords: advancing-front approach
zbMATH Keywords: geometric algorithm
zbMATH Keywords: distance-field applications
describes a project that uses: Qhull
MaRDI profile type: Publication
full work available at URL: j.camwa.2016.02.032
OpenAlex ID: W2305748903
cites work: Filling domains with disks: an advancing front approach
cites work: An algorithm to generate random dense arrangements for discrete element simulations of granular assemblies
cites work: Geometrical modeling of granular structures in two and three dimensions. Application to nanostructures
cites work: A fast and practical method to pack spheres for mesh generation
cites work: Analysis of a triangulation based approach for specimen generation for discrete element simulations.
cites work: The quickhull algorithm for convex hulls
cites work: A geometric algorithm based on tetrahedral meshes to generate a dense polydisperse sphere packing
cites work: Packing spherical discrete elements for large scale simulations
cites work: THE FRACTAL DIMENSION OF THE APOLLONIAN SPHERE PACKING
cites work: Q3723577
cites work: Determining the spatial containment of a point in general polyhedra
cites work: High-density sphere packing for discrete element method simulations
cites work: Geometric properties of random disk packings.
DOI: 10.1016/J.CAMWA.2016.02.032
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 7259730