A fast contact detection algorithm insensitive to object sizes
From MaRDI portal
Publication:2726093
DOI10.1108/02644400110365770zbMath1015.74079OpenAlexW2065769087MaRDI QIDQ2726093
Eric Perkins, John R. Williams
Publication date: 5 August 2003
Published in: Engineering Computations (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1108/02644400110365770
contact detection algorithmdiscrete element techniquesdouble-ended spatial sortingnon-spherical geometrynon-uniform sizesspatial hashing
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (15)
Numerical simulation of fracking in shale rocks: current state and future approaches ⋮ SMB: Collision detection based on temporal coherence ⋮ A new algorithm for contact detection between spherical particle and triangulated mesh boundary in discrete element method simulations ⋮ Development of contact algorithm for three-dimensional numerical manifold method ⋮ A contact detection algorithm for multi-sphere particles by means of two-level-grid-searching in DEM simulations ⋮ Framework for automatic contact detection in a multibody system ⋮ Contact detection by the contact theory in 2D-DDA for arbitrary polygonal blocks ⋮ A contact detection algorithm for superellipsoids based on the common‐normal concept ⋮ An efficient numerical approach for simulating contact in origami assemblages ⋮ A direct simulation method for particle‐fluid systems ⋮ Contact resolution algorithm for an ellipsoid approximation for discrete element modeling ⋮ A contact algorithm for partitioning N arbitrary sized objects ⋮ Transgranular fracturing of crystalline rocks and its influence on rock strengths: insights from a grain-scale continuum-discontinuum approach ⋮ Three‐dimensional discrete element simulation for granular materials ⋮ Parallel discrete element simulation of poly-dispersed granular material
Cites Work
This page was built for publication: A fast contact detection algorithm insensitive to object sizes