Title:

Parallel Particle Packing - A parallel approach to densely pack discs in a
square.
Richard Lowasser (CSE) and Chris Schroeder (Physics)
 

Official abstract from our project report:

A parallel algorithm has been implemented to solve larger instances of the
static packing problem - i.e., given a number of discs, compute the
maximum radius such that the discs fit within the unit square without
overlapping. An existing serial algorithm available at was taken as a
basis and modified towards the main objective of this project, high
performance on high numbers of discs. It was shown that the existing
serial algorithm performs poorly on high disc counts. The modified,
parallel approach solves this issue and achieves a running time only
dependent on the number of discs per
processor.