AbstractWe present new, efficient packings for 16, 17 and 18 congruent circles in an equilateral triangle. The results have been found by the use of simulated annealing and a quasi-Newton optimization technique, supplemented with some human intelligence
We consider packings of congruent circles on a square flat torus, i.e., periodic (w.r.t. a square la...
This paper describes an approved algorithm for the problems of unequal circle packing – the quasi-ph...
Abstract. Dense packing of equal circles on a sphere is investigated. A systematic algorithm, the Mi...
We present new, efficient packings for 16, 17 and 18 congruent circles in an equilateral triangle. T...
AbstractWe present new, efficient packings for 16, 17 and 18 congruent circles in an equilateral tri...
We report the dense configurations of 2 ≤ N ≤ 400 congruent disks packed inside an equilateral trian...
The paper presents a new verified optimization method for the problem of finding the densest packing...
AbstractIn this paper the problem of packing n equal circles into the unit square will be considered...
The focus of study in this paper is the class of packing problems. More specifically, it deals with ...
Abstract. The densest packings of n congruent circles in a circle are known for n ≤ 12 and n = 19. I...
. A circle packing is a configuration P of circles realizing a specified pattern of tangencies. We d...
Previously published packings of equal disks in an equilateral triangle have dealt with up to 21 dis...
Recently, M~lissen has determined the thinnest coverings of an equilateral tri-angle with 1,...,6, a...
We consider packings of congruent circles on a square flat torus, i.e., periodic (w.r.t. a square la...
AbstractA circle packing is a configuration P of circles realizing a specified pattern of tangencies...
We consider packings of congruent circles on a square flat torus, i.e., periodic (w.r.t. a square la...
This paper describes an approved algorithm for the problems of unequal circle packing – the quasi-ph...
Abstract. Dense packing of equal circles on a sphere is investigated. A systematic algorithm, the Mi...
We present new, efficient packings for 16, 17 and 18 congruent circles in an equilateral triangle. T...
AbstractWe present new, efficient packings for 16, 17 and 18 congruent circles in an equilateral tri...
We report the dense configurations of 2 ≤ N ≤ 400 congruent disks packed inside an equilateral trian...
The paper presents a new verified optimization method for the problem of finding the densest packing...
AbstractIn this paper the problem of packing n equal circles into the unit square will be considered...
The focus of study in this paper is the class of packing problems. More specifically, it deals with ...
Abstract. The densest packings of n congruent circles in a circle are known for n ≤ 12 and n = 19. I...
. A circle packing is a configuration P of circles realizing a specified pattern of tangencies. We d...
Previously published packings of equal disks in an equilateral triangle have dealt with up to 21 dis...
Recently, M~lissen has determined the thinnest coverings of an equilateral tri-angle with 1,...,6, a...
We consider packings of congruent circles on a square flat torus, i.e., periodic (w.r.t. a square la...
AbstractA circle packing is a configuration P of circles realizing a specified pattern of tangencies...
We consider packings of congruent circles on a square flat torus, i.e., periodic (w.r.t. a square la...
This paper describes an approved algorithm for the problems of unequal circle packing – the quasi-ph...
Abstract. Dense packing of equal circles on a sphere is investigated. A systematic algorithm, the Mi...
DOI
Add to ORKG