BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Circle packing in arbitrary domains - Paolo Amore (Universidad de 
 Colima)
DTSTART:20230823T103000Z
DTEND:20230823T110000Z
UID:TALK202621@talks.cam.ac.uk
DESCRIPTION:Circle packing is a challenging computational problem\, which 
 has been studied systematically only for a handful of domains (the disk\, 
 the square\, the rectangle\, regular polygons and few others). Finding the
  global maximum of the packing fraction becomes increasingly difficult as 
 N (number of disks) grows and proofs of&nbsp\; optimality only exist for s
 pecial domains and limited N. There is considerable interest\, however\, i
 n finding good packings in more general domains\, because of the multiple 
 applications of packing to different areas of knowledge.\nWe have devised 
 an algorithm that\, at least in principle\, can be used to obtain densely 
 packed configurations in arbitrary domains (we will only discuss two dimen
 sional examples but the extension to three or even higher dimension is str
 aightforward)\, which include ellipses with arbitrary eccentricity\, recta
 ngles of different proportions\, multiply connected domains (for instance 
 a concentric circular annulus)\, concave domains (for example a cross of v
 arying proportions) and even domains with a singularity on the border (the
  cardioid). Numerical results for all these cases will be presented.\nOur 
 algorithm could be applied with minor modifications to study packing confi
 gurations in tubular containers or more general containers in three dimens
 ions of arbitrary shape.
LOCATION:External
END:VEVENT
END:VCALENDAR