Comparison of methods computing the distance between two ellipsoids
From MaRDI portal
Publication:2139027
DOI10.1016/j.jcp.2022.111100OpenAlexW4214873345MaRDI QIDQ2139027
Ivan Girault, Mohamed-Amine Chadil, Stéphane Vincent
Publication date: 17 May 2022
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcp.2022.111100
Numerical approximation and computational geometry (primarily algorithms) (65Dxx) Mathematical programming (90Cxx) Multiphase and multicomponent flows (76Txx)
Related Items (1)
Cites Work
- Random generation of periodic hard ellipsoids based on molecular dynamics: a computationally-efficient algorithm
- A Lagrangian VOF tensorial penalty method for the DNS of resolved particle-laden flows
- An algebraic approach to continuous collision detection for ellipsoids
- Computation of the distance from an ellipsoid to a linear surface and a quadric in \(\mathbb R^n\)
- Assessment of numerical methods for fully resolved simulations of particle-laden turbulent flows
- Particle-scale computational approaches to model dry and saturated granular flows of non-Brownian, non-cohesive, and non-spherical rigid bodies
- Charged ball method for solving some computational geometry problems
- Particle-resolved numerical simulations of the gas-solid heat transfer in arrays of random motionless particles
- Impact of shape: DNS of sediment transport with non-spherical particles
- On the Distance between Two Ellipsoids
- Finding the distance between ellipsoids
- An algebraic condition for the separation of two ellipsoids
This page was built for publication: Comparison of methods computing the distance between two ellipsoids
