399 citations · 1.1k across the 26 of their papers we have counts for
1 paper · 2 filters
Pierre Degond, Marina A. Ferreira, Sébastien Motsch
We consider algorithms that, from an arbitrarily sampling of N spheres (possibly overlapping), find a close packed configuration without overlapping. These problems can be formul…