Random generation of periodic hard ellipsoids based on molecular dynamics: a computationally-efficient algorithm
Publication:348151
DOI10.1016/j.jcp.2013.07.004zbMath1349.65081OpenAlexW2008762786MaRDI QIDQ348151
Elias Ghossein, Martin Lévesque
Publication date: 5 December 2016
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcp.2013.07.004
molecular dynamicsbinary collisionshard ellipsoidshigh aspect ratiosorientations distributionrandom periodic packings
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Discrete geometry (52C99)
Related Items (6)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An algebraic approach to continuous collision detection for ellipsoids
- Neighbor list collision-driven molecular dynamics simulation for nonspherical hard particles. I: Algorithmic details
- Neighbor list collision-driven molecular dynamics simulation for nonspherical hard particles. II: Applications to ellipses and ellipsoids
- How to simulate billiards and similar systems
- Comparison between the relaxation spectra obtained from homogenization models and finite elements simulation for the same composite
- Statistical mechanics of hard ellipsoids. I. Overlap algorithm and the contact function
- Disks vs. spheres: Contrasting properties of random packings
- Determination of the size of the representative volume element for random composites: Statistical and numerical approach.
- A numerical approximation to the elastic properties of sphere-reinforced composites.
- Geometric properties of random disk packings.
- Algorithms in real algebraic geometry
- An algebraic condition for the separation of two ellipsoids
- Random heterogeneous materials. Microstructure and macroscopic properties
This page was built for publication: Random generation of periodic hard ellipsoids based on molecular dynamics: a computationally-efficient algorithm