Show simple item record

dc.contributor.authorMatthew R. Kuhn
dc.date.accessioned2017-05-08T22:40:03Z
dc.date.available2017-05-08T22:40:03Z
dc.date.copyrightMay 2003
dc.date.issued2003
dc.identifier.other%28asce%290733-9399%282003%29129%3A5%28539%29.pdf
dc.identifier.urihttp://yetl.yabesh.ir/yetl/handle/yetl/85735
dc.description.abstractStable and efficient algorithms are presented for a three-dimensional particle for discrete-element simulations. The particle, termed an “ovoid,” approximates an axisymmetric ellipsoid but is composed of two spherical caps and a middle torus section. The particle is smooth and strictly convex, and both prolate and oblate shapes are possible. Contact inquiry between two ovoids involves finding the minimum distance between two circles in three-dimensional space, and an efficient iterative algorithm is applied to this purpose. Computer trials show that the algorithms are stable and that runtimes are only modestly longer than for assemblies of spheres.
dc.publisherAmerican Society of Civil Engineers
dc.titleSmooth Convex Three-Dimensional Particle for the Discrete-Element Method
dc.typeJournal Paper
dc.journal.volume129
dc.journal.issue5
dc.journal.titleJournal of Engineering Mechanics
dc.identifier.doi10.1061/(ASCE)0733-9399(2003)129:5(539)
dc.treeJournal of Engineering Mechanics:;2003:;Volume ( 129 ):;issue: 005
dc.contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record