- Experiment. Math.
- Volume 9, Issue 2 (2000), 241-250.
Conjecturally optimal coverings of an equilateral triangle with up to 36 equal circles
This paper presents a computational method to find good, conjecturally optimal coverings of an equilateral triangle with up to 36 equal circles. The algorithm consists of two nested levels: on the inner level the uncovered area of the triangle is minimized by a local optimization routine while the radius of the circles is kept constant. The radius is adapted on the outer level to find a locally optimal covering. Good coverings are obtained by applying the algorithm repeatedly to random initial configurations.
The structures of the coverings are determined and the coordinates of each circle are calculated with high precision using a mathematical model for an idealized physical structure consisting of tensioned bars and frictionless pin joints. Best found coverings of an equilateral triangle with up to 36 circles are displayed, 19 of which are either new or improve on earlier published coverings.
Experiment. Math. Volume 9, Issue 2 (2000), 241-250.
First available in Project Euclid: 22 February 2003
Permanent link to this document
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Primary: 52C17: Packing and covering in $n$ dimensions [See also 05B40, 11H31]
Nurmela, Kari J. Conjecturally optimal coverings of an equilateral triangle with up to 36 equal circles. Experiment. Math. 9 (2000), no. 2, 241--250.https://projecteuclid.org/euclid.em/1045952348