Corpus ID: 14765593

COVERING A SQUARE WITH UP TO 30 EQUAL CIRCLES

@inproceedings{Nurmela2000COVERINGAS,
  title={COVERING A SQUARE WITH UP TO 30 EQUAL CIRCLES},
  author={Kari J. Nurmela and Patric R. J. Osterga},
  year={2000}
}
A computational method for finding good coverings of a square with equal circles is presented. The algorithm uses a quasi-Newton method with BFGS secant update to minimize the uncovered area by moving the circles. The radius of the circles is further adapted to find locally optimal coverings, and the algorithm is applied 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… Expand

Figures and Tables from this paper

Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles
  • K. Nurmela
  • Computer Science, Mathematics
  • Exp. Math.
  • 2000
TLDR
This paper presents a computational method to find good, conjecturally optimal coverings of an equilateral triangle with up to 36 equal circles, 19 of which are either new or improve on earlier published coverings. Expand
Optimal Covering Points and Related Problems
We consider the optimal covering of the unit square by N circles. By optimal, we mean the covering that can be done with N circles of minimum radius. Equivalently, we study the problem of the optimalExpand
A Shape-Newton approach to the problem of covering with identical balls
The problem of covering a region of the plane with a fixed number of minimum-radius identical balls is studied in the present work. An explicit construction of bi-Lipschitz mappings is provided toExpand
Covering a compact polygonal set by identical circles
TLDR
A modification of the Zoutendijk feasible directions method is developed to search local minima of compact polygonal set by identical circles of minimal radius based on Voronoi polygons. Expand
Global Optimization with the use optimal covering
TLDR
An abridged description of optimal stratified sampling and optimal covering algorithms containing only the essential of the methods is presented and a set of computational results is presented. Expand
Congruent Circles Packing and Covering Problems for Multi-Connected Domains with Non-Euclidean Metric , and Their Applications to Logistics
The article is devoted to optimal covering and packing problems for a bounded set in a two-dimensional metric space with a given amount of congruous circles. Such problems are of both theoreticalExpand
A novel circle covering algorithm based on Coulomb Force Model for the problem of locating repeaters
TLDR
A novel circle covering algorithm for the problem of locating repeaters when users in a certain area need to be covered, and a physical model — the Coulomb Force Model is proposed — to solve this multi-layer problem. Expand
On reserve and double covering problems for the sets with non-Euclidean metrics
TLDR
The article is devoted to Circle covering problem for a bounded set in a two-dimensional metric space with a given amount of circles, and considers the case where covering set is a multiply-connected domain. Expand
Efficient algorithm for placing a given number of base stations to cover a convex region
TLDR
An efficient algorithm for the base-station placement problem is developed using Voronoi diagram which works for covering a convex region of arbitrary shape and the execution time is a fraction of a second. Expand
On covering the square flat torus by congruent discs
  • A. Joós
  • Computer Science
  • Australas. J Comb.
  • 2019
TLDR
These are periodic discs coverings of the Euclidean plane by congruent discs of minimal radius such that the square flat torus can be covered by these discs. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 33 REFERENCES
Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles
  • K. Nurmela
  • Computer Science, Mathematics
  • Exp. Math.
  • 2000
TLDR
This paper presents a computational method to find good, conjecturally optimal coverings of an equilateral triangle with up to 36 equal circles, 19 of which are either new or improve on earlier published coverings. Expand
Packing up to 50 Equal Circles in a Square
TLDR
Computational methods to find good packings of more than 20 circles are discussed and a new packing of 49 circles settles the proof that when n is a square number, the best packing is the square lattice exactly when n≤ 36. Expand
Improved Coverings of a Square with Six and Eight Equal Circles
TLDR
Improved coverings with six and eight circles and a new, thin covering with eleven circles are given by the use of simulated annealing and a combinatorial method for constructing lower bounds for the optimal covering radius is presented. Expand
Covering a Rectangle With Equal Circles
Recently, Tarnai and Gáspár [22] used mechanically inspired computer simulations to construct thin coverings of a square with up to ten equal circles. We generalise the problem to rectangles andExpand
More Optimal Packings of Equal Circles in a Square
TLDR
The computer-aided approach to densest packings of n equal circles in a square is further developed here and the range is extended to n ≤ 27 . Expand
Packing circles in a square: A review and new results
There are many interesting optimization problems associated with the packing and covering of objects in a closed volume or bounded surface Typical examples arise in classical physics or chemistryExpand
Covering a Rectangle with Six and Seven Circles
TLDR
For six and seven circles, the thinnest possible covering is determined and thin coverings are given for the remaining range of values, thereby extending the previous conjecture for the square. Expand
Dense packings of congruent circles in a circle
Abstract The problem of finding packings of congruent circles in a circle, or, equivalently, of spreading points in a circle, is considered. Two packing algorithms are discussed, and the bestExpand
Algorithm 611: Subroutines for Unconstrained Minimization Using a Model/Trust-Region Approach
  • D. Gay
  • Computer Science
  • TOMS
  • 1983
This paper describes a set of subroutines designed to solve general unconstrained optimization problems for which it is feasible to work explicitly with either the Hessian of the objective functionExpand
Unsolved Problems In Geometry
TLDR
A monograph on geometry, each section in the book describes a problem or a group of related problems, capable of generalization of variation in many directions. Expand
...
1
2
3
4
...