Intersecting dilated convex polyhedra method for modeling complex particles in discrete element method
نویسندگان
چکیده
منابع مشابه
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, capsules, and dilated triangles to be combined with polyhedra using the same approach. The compu...
متن کاملA Finite Element Method on Convex Polyhedra
We present a method for animating deformable objects using a novel finite element discretization on convex polyhedra. Our finite element approach draws upon recently introduced 3D mean value coordinates to define smooth interpolants within the elements. The mathematical properties of our basis functions guarantee convergence. Our method is a natural extension to linear interpolants on tetrahedr...
متن کاملCollision detection of convex polyhedra on the NVIDIA GPU architecture for the discrete element method
Convex polyhedra represent granular media well. This geometric representation may be critical in obtaining realistic simulations of many industrial processes using the discrete element method (DEM). However detecting collisions between the polyhedra and surfaces that make up the environment and the polyhedra themselves is computationally expensive. This paper demonstrates the significant comput...
متن کاملmodeling of different subsoiler tines performance using discrete element method
for designing tillage implements it would be better to estimate soil forces exerted to the implements. many researches showed that numerical method of discrete element method (dem) is the cheapest and fastest technique for modeling granular material such as soil and especially sandy soil. in this study, paraplow and bentleg tines performance was compared with conventional tine using experimenta...
متن کاملAn Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra
This paper describes a linear-time algorithm for computing the intersection of two convex polyhedra in 3-space. Applications of this result to computing intersections, convex hulls, and Voronoi diagrams are also given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Numerical and Analytical Methods in Geomechanics
سال: 2014
ISSN: 0363-9061,1096-9853
DOI: 10.1002/nag.2299