Filling domains with disks: an advancing front approach
From MaRDI portal
Publication:4416986
DOI10.1002/nme.583zbMath1078.74679MaRDI QIDQ4416986
David R. Owen, Kuanjin Han, Yun Tian Feng
Publication date: 6 August 2003
Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nme.583
74E20: Granularity
Related Items
A fast and practical method to pack spheres for mesh generation, Discrete thermal element modelling of heat conduction in particle systems: Basic formulations, Analysis of a triangulation based approach for specimen generation for discrete element simulations., Statistical inference for disordered sphere packings, Characterising particle packings by principal component analysis, Advances in particle packing algorithms for generating the medium in the discrete element method, An efficient algorithm to generate random sphere packs in arbitrary domains, An algorithm to generate dense and stable particle assemblies for 2D DEM simulation, Adaptive surface mesh remeshing based on a sphere packing method and a node insertion/deletion method, A generic contact detection framework for cylindrical particles in discrete element modelling, A novel three-dimensional mesh deformation method based on sphere relaxation, Generation of finite element mesh with variable size over an unbounded 2D domain, Generation of tetrahedral mesh of variable element size by sphere packing over an unbounded 3D domain, An algorithm to generate random dense arrangements for discrete element simulations of granular assemblies, New 3D geometrical deposition methods for efficient packing of spheres based on tangency, Contributions to the generalization of advancing front particle packing algorithms, Sphere Packing Based on Geometric Algorithm Generation Method, Performance comparisons of tree‐based and cell‐based contact detection algorithms, An advancing front technique for filling space with arbitrary separated objects
Cites Work
