Polyhedra faster than spheres?. Issue 3 (28th April 2014)

• Record Type: Journal Article
• Authors: A. Hopkins, Mark
• Is Part Of: Engineering computations. Volume 31:Issue 3(2014)
• Page Start: 567
• Page End: 583
• Publication Date: 2014-04-28
• Subjects: DEM -- Discrete element modelling -- Polyhedral grains; Computer-aided engineering -- Periodicals; Computer graphics -- Periodicals; 620.00285
• DOI: 10.1108/EC-09-2012-0211
• Languages: English
• ISSNs: 0264-4401

Abstract

Abstract : Purpose: – The purpose of this paper is to present a new and efficient technique for discrete element modelling using non-convex polyhedral grain shapes. Design/methodology/approach: – The efficiency of the technique follows from the use of grains that are dilated versions of the basic polyhedral grain shapes. Dilation of an arbitrary polyhedral grain is accomplished by placing the center of a sphere of fixed radius at every point on the surface. The dilated vertices become sphere segments and the edges become cylinder segments. The sharpness of the vertices and edges can be adjusted by varying the dilation radius. Contacts between two dilated polyhedral grains can be grouped into three categories; vertex on surface, vertex on edge, and edge on edge, or in the grammar of the model, sphere on polygonal surface, sphere on cylinder, and cylinder on cylinder. Simple, closed-form solutions exist for each of these cases. Findings: – The speed of the proposed polyhedral discrete element model is compared to similar models using spherical and ellipsoidal grains. The polyhedral code is found to run about 40 percent as fast as an equivalent code using spherical grains and about 80 percent as fast as an equivalent code using ellipsoidal grains. Finally, several applications of the polyhedral model are illustrated. Originality/value: – Few examples of discrete element modeling studies in the literature use polyhedral grains. This dearth is because of the perceived complexity of the polyhedral coding challenges and the slow speed of the codes compared to codes for other grain shapes. This paper presents a much simpler approach to discrete element modeling using polyhedral grain shapes.