Math 2.0

Convex and discrete geometry Definition

Circle packing

Builds on CircleClosed ball

Definition

Let (Ci)i∈I(C_i)_{i \in I} be a family of circles of positive radius in the plane ℝ2\R^2, and let DiD_i be the closed disc bounded by CiC_i. The family is a circle packing if the discs DiD_i have pairwise disjoint interiors. Its tangency graph has vertex set II, with an edge between distinct ii and jj when CiC_i and CjC_j are tangent. A packing of equal circles is one in which all radii are equal.

Remarks

Example: the circles of radius 11 centred at (0,0)(0, 0) and (2,0)(2, 0). The distance between centres is 22, the sum of the radii, so the discs meet in the single point (1,0)(1, 0) and their interiors are disjoint. The tangency graph is one edge. Non-example: circles of radius 11 centred at (0,0)(0, 0) and (1,0)(1, 0); the distance 11 is less than 22, so the open discs overlap. The same notion is used on the sphere and in the hyperbolic plane. A packing of equal circles of radius rr is the same as a sphere packing in ℝ2\R^2 with radius rr.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Circle concept
  2. Closed ball concept
  3. Circle packing definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Circle_packing
About this page
TagJJ0PQZ7VZX
URIm2://JJ0PQZ7VZX
Kinddefinition
WritingW0 stub
MSC52C15, 52C26, 05B40
DefinesCircle packing
UsesCircle, Closed ball

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.