Performance comparisons of tree‐based and cell‐based contact detection algorithms
From MaRDI portal
Publication:3055829
DOI10.1108/02644400710729554zbMath1198.74118OpenAlexW2027598300MaRDI QIDQ3055829
Yun Tian Feng, David R. Owen, Kuanjin Han
Publication date: 10 November 2010
Published in: Engineering Computations (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1108/02644400710729554
Related Items
Investigation of adequacy of multi-sphere approximation of elliptical particles for DEM simulations, A new algorithm for contact detection between spherical particle and triangulated mesh boundary in discrete element method simulations, A contact detection algorithm for multi-sphere particles by means of two-level-grid-searching in DEM simulations, Combined three-dimensional lattice Boltzmann method and discrete element method for modelling fluid-particle interactions with experimental assessment, YADE‐OPEN DEM: an open‐source software using a discrete element method to simulate granular material, A coupled 3D isogeometric and discrete element approach for modeling interactions between structures and granular matters, A comparison of data structures for the simulation of polydisperse particle packings
Cites Work
- Unnamed Item
- SMB: Collision detection based on temporal coherence
- The modelling of multi-fracturing solids and particulate media
- An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems
- Filling domains with disks: an advancing front approach
- A contact algorithm for partitioning N arbitrary sized objects
- A 2D polygon/polygon contact model: algorithmic aspects
- An augmented spatial digital tree algorithm for contact detection in computational mechanics
