Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles
From MaRDI portal
Publication:2743873
DOI10.1080/10586458.2000.10504649zbMath0986.52011OpenAlexW2039539870MaRDI QIDQ2743873
Publication date: 17 September 2001
Published in: Experimental Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.em/1045952348
Related Items (12)
Optimal circle covering problems and their applications ⋮ Unnamed Item ⋮ A Shape-Newton Approach to the Problem of Covering with Identical Balls ⋮ Covering a convex 3D polytope by a minimal number of congruent spheres ⋮ Packing, covering and tiling in two-dimensional spaces ⋮ Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles ⋮ AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS ⋮ Covering a compact polygonal set by identical circles ⋮ On the Number and Arrangement of Sensors for the Multiple Covering of Bounded Plane Domains ⋮ On reserve and double covering problems for the sets with non-Euclidean metrics ⋮ A Shape Optimization Approach to the Problem of Covering a Two-Dimensional Region with Minimum-Radius Identical Balls ⋮ Optimization of the number and arrangement of circles of two radii for forming a \(k\)-covering of a bounded set
Cites Work
- Unnamed Item
- Unsolved problems in geometry
- Packing up to 50 equal circles in a square
- Covering a rectangle with equal circles
- Dense packings of congruent circles in a circle
- Covering a rectangle with six and seven circles
- A Newton-Raphson method for the solution of systems of equations
- Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles
- Algorithm 611: Subroutines for Unconstrained Minimization Using a Model/Trust-Region Approach
- Densest Packings of Congruent Circles in an Equilateral Triangle
This page was built for publication: Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles
