P16 spread points in a triangle: n = 19–100
Place n points in the right isosceles triangle with legs 1 so that the closest two are as far apart as possible. 82 new instances cite the values and authors of Packomania's table for this triangle (Specht, Cantrell, López Soto and others). The n = 13 credit is corrected to Claudia Orquídea López Soto, and rows the table leaves unattributed now point to the table's own attribution.
P12 circles in a rectangle: n = 13–100
Pack n equal circles into a 2 × 1 rectangle with the largest radius. Packomania's table for the 1 × 0.5 rectangle is the same problem scaled by two and runs to n = 300. 88 new instances, and n = 7–12, which had no external benchmark, now cite the table too.
P13 graduated circles in a square: n = 31–100
Pack circles of radii 1, 2, …, n into the smallest square. 70 new instances cite Packomania's table, most of them André Müller's results published in 2025. The existing n = 5–30 keep their values and now credit the authors the table names for each row.
P82 circles in regular polygons: pentagon and hexagon to n = 100, octagon to n = 48
Pack n equal circles into a regular polygon of circumradius 1 with the largest radius. 128 new instances cite the values and authors of Packomania's three polygon tables (Specht, Amore, Zorcic). The octagon's table stops at n = 48.
Where the values come from
Every external value is taken from Packomania (packomania.com), compiled by Eckard Specht, read on 2026-10-15 with each file hashed. The site cites the values and authors and does not copy the tables’ coordinates; the starting layouts are ordinary legal layouts generated here and bylined MinMax Arena.