A packing algorithm for three-dimensional convex particles

Yusin Lee, Chung Fang, You Ren Tsou, Li Sin Lu, Cheng Tao Yang

Research output: Contribution to journalArticlepeer-review

39 Citations (Scopus)

Abstract

Simulation of granular particles is an important tool in many fields. However, simulation of particles of complex shapes remains largely out of reach even in two-dimension. One of the major hurdles is the difficulty in representing particles in an efficient, flexible, and accurate manner. By representing particles as convex polyhedrons which are themselves the intersection of a set of half spaces, we develop a method that allows one to efficiently carry out key operations, including particle-particle and particle-container wall overlapping detection, precise identification of the overlapping region, particle shifting, particle rotation, and others. The simulation of packing 1,000 particles into a container takes only a few minutes with this approach. We further demonstrate the potential of this approach with a simulation that re-generates the "Brazil nut" phenomenon by mixing and shaking particles of two different sizes.

Original languageEnglish
Pages (from-to)307-315
Number of pages9
JournalGranular Matter
Volume11
Issue number5
DOIs
Publication statusPublished - 2009 Oct 1

All Science Journal Classification (ASJC) codes

  • Materials Science(all)
  • Mechanics of Materials
  • Physics and Astronomy(all)

Fingerprint Dive into the research topics of 'A packing algorithm for three-dimensional convex particles'. Together they form a unique fingerprint.

Cite this