Cargando…
Intersecting dilated convex polyhedra method for modeling complex particles in discrete element method
This paper describes a new method for representing concave polyhedral particles in a discrete element method as unions of convex dilated polyhedra. This method offers an efficient way to simulate systems with a large number of (generally concave) polyhedral particles. The method also allows spheres,...
Autores principales: | Nye, Ben, Kulchitsky, Anton V, Johnson, Jerome B |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BlackWell Publishing Ltd
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4540157/ https://www.ncbi.nlm.nih.gov/pubmed/26300584 http://dx.doi.org/10.1002/nag.2299 |
Ejemplares similares
-
Convex Polyhedra
por: Alexandrov, A D
Publicado: (2005) -
Classifying Simplicial Dissections of Convex Polyhedra with Symmetry
por: Betten, Anton, et al.
Publicado: (2020) -
Computing the continuous discretely: integer-point enumeration in polyhedra
por: Beck, Matthias, et al.
Publicado: (2007) -
Elucidation of the origin of chiral amplification in discrete molecular polyhedra
por: Wang, Yu, et al.
Publicado: (2018) -
Convex and Discrete Geometry
por: Gruber, Peter M
Publicado: (2007)