In geometry, circle packing is the study of the arrangement of circles (of equal or varying sizes) on a given surface such that no overlapping occurs...
11 KB (1,307 words) - 12:16, 13 September 2023
Circle packing in a circle is a two-dimensional packing problem with the objective of packing unit circles into the smallest possible larger circle. If...
7 KB (370 words) - 07:36, 12 November 2024
squares can be packed into some larger shape, often a square or circle. Square packing in a square is the problem of determining the maximum number of...
10 KB (1,035 words) - 15:58, 10 November 2024
Circle packing in a square is a packing problem in recreational mathematics, where the aim is to pack n unit circles into the smallest possible square...
5 KB (259 words) - 20:16, 19 June 2024
The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane whose...
30 KB (3,849 words) - 21:00, 17 August 2024
distinct from the ideas in the circle packing theorem. The related circle packing problem deals with packing circles, possibly of different sizes, on...
22 KB (2,676 words) - 21:01, 23 July 2024
to Circle Packing: The Theory of Discrete Analytic Functions is a mathematical monograph concerning systems of tangent circles and the circle packing theorem...
7 KB (801 words) - 07:26, 14 August 2023
sphere packing problems can be generalised to consider unequal spheres, spaces of other dimensions (where the problem becomes circle packing in two dimensions...
28 KB (3,414 words) - 10:33, 14 November 2024
is the three-dimensional equivalent of the circle packing in a circle problem in two dimensions. Best packing of m>1 equal spheres in a sphere setting a...
3 KB (58 words) - 00:34, 21 June 2024
Apollonian gasket (redirect from Apollonian packing)
Integral Apollonian circle packing defined by circle curvatures of (−3, 5, 8, 8) Integral Apollonian circle packing defined by circle curvatures of (−12...
24 KB (2,699 words) - 20:44, 27 October 2024
Trihexagonal tiling (section Circle packing)
as a circle packing, placing equal diameter circles at the center of every point. Every circle is in contact with 4 other circles in the packing (kissing...
16 KB (1,625 words) - 20:35, 27 October 2024
Hexagonal tiling (section Circle packing)
as a circle packing, placing equal-diameter circles at the center of every point. Every circle is in contact with 3 other circles in the packing (kissing...
16 KB (1,286 words) - 16:31, 7 November 2024
Casey's theorem Circle graph Circle map Circle packing Circle packing in a circle Circle packing in an equilateral triangle Circle packing in an isosceles...
9 KB (696 words) - 14:58, 22 March 2024
Descartes' theorem (redirect from Soddy circle)
{\displaystyle C=-2} in hyperbolic geometry. Circle packing in a circle Euler's four-square identity Malfatti circles Soddy, F. (June 1936), "The Kiss Precise"...
50 KB (6,368 words) - 21:18, 29 July 2024
Square tiling (section Circle packing)
as a circle packing, placing equal diameter circles at the center of every point. Every circle is in contact with 4 other circles in the packing (kissing...
9 KB (619 words) - 22:03, 19 November 2024
Circle packing in an equilateral triangle is a packing problem in discrete mathematics where the objective is to pack n unit circles into the smallest...
5 KB (365 words) - 01:52, 25 January 2024
Colin L.; Wilks, Allan R.; Yan, Catherine H. (2003), "Apollonian circle packings: number theory", Journal of Number Theory, 100 (1): 1–45, arXiv:math...
11 KB (1,503 words) - 12:08, 8 November 2023
Inversive distance (section Circle packings)
This concept generalizes the circle packings described by the circle packing theorem, in which specified pairs of circles are tangent to each other. Although...
8 KB (1,083 words) - 18:59, 5 September 2024
Steinitz's theorem (section Circle packing)
system and lifting the result into three dimensions, or by using the circle packing theorem. Several extensions of the theorem are known, in which the polyhedron...
50 KB (5,973 words) - 15:13, 2 November 2024
Rhombitrihexagonal tiling (section Circle packing)
as a circle packing, placing equal diameter circles at the center of every point. Every circle is in contact with four other circles in the packing (kissing...
12 KB (922 words) - 16:01, 15 November 2024
set of Kleinian groups; see also Circle packing theorem. The circles of Apollonius may also denote three special circles C 1 , C 2 , C 3 {\displaystyle...
15 KB (2,411 words) - 23:06, 27 May 2024
allocations is referred to as the 'circle-packing' or 'polygon-packing'. Using optimization algorithms, a circle-packing figure can be computed for any uniaxial...
48 KB (5,879 words) - 06:31, 17 October 2024
even when the locations are fixed. Circle packing in a rectangle Square packing in a square De Bruijn's theorem: packing congruent rectangular bricks of...
7 KB (949 words) - 22:11, 2 January 2024
Truncated hexagonal tiling (section Circle packing)
as a circle packing, placing equal diameter circles at the center of every point. Every circle is in contact with 3 other circles in the packing (kissing...
9 KB (745 words) - 20:10, 13 July 2024
in the late 19th century. Early topics studied were: the density of circle packings by Thue, projective configurations by Reye and Steinitz, the geometry...
15 KB (1,575 words) - 05:36, 16 October 2024
Snub trihexagonal tiling (section Circle packing)
as a circle packing, placing equal diameter circles at the center of every point. Every circle is in contact with 5 other circles in the packing (kissing...
11 KB (814 words) - 22:07, 12 December 2023
Truncated trihexagonal tiling (section Circle packing)
as a circle packing, placing equal diameter circles at the center of every point. Every circle is in contact with 3 other circles in the packing (kissing...
10 KB (728 words) - 21:54, 12 December 2023
In geometry, the Soddy circles of a triangle are two circles associated with any triangle in the plane. Their centers are the Soddy centers of the triangle...
11 KB (1,282 words) - 14:37, 6 February 2024
the densest possible circle packing. Every circle is in contact with 6 other circles in the packing (kissing number). The packing density is π⁄√12 or 90...
10 KB (858 words) - 18:52, 21 November 2024
2-dimensional analog of Kepler's conjecture: the regular hexagonal packing is the densest circle packing in the plane (1890). This disambiguation page lists articles...
625 bytes (119 words) - 20:55, 13 June 2021