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 r...

Full description

Saved in:
Bibliographic Details
Published in:Experimental mathematics 2000-01, Vol.9 (2), p.241-250
Main Author: Nurmela, Kari J.
Format: Article
Language:English
Subjects:
52C17
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 byapplying 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.
ISSN:1058-6458
1944-950X
DOI:10.1080/10586458.2000.10504649