ArticleslgStudy

mathematics

Introduction to Circle Packing

Introduction to Circle Packing is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Introduction to Circle Packing rather than just read about it. In short: Introduction to Circle Packing: The Theory of Discrete Analytic Functions is a mathematical monograph concerning systems of tangent circles and the circle packing theorem. It was written by Kenneth Stephenson and published in 2005 by the Cambridge University Press.

Introduction to Circle Packing — main illustration
Introduction to Circle Packing — illustration

Key takeaways

  • Introduction to Circle Packing belongs to mathematics; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Introduction to Circle Packing to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Introduction to Circle Packing from memory before moving on to harder problems.

Reference excerpt

Introduction to Circle Packing: The Theory of Discrete Analytic Functions is a mathematical monograph concerning systems of tangent circles and the circle packing theorem. It was written by Kenneth Stephenson and published in 2005 by the Cambridge University Press.

Topics Circle packings, as studied in this book, are systems of circles that touch at tangent points but do not overlap, according to a combinatorial pattern of adjacencies specifying which pairs of circles should touch. The circle packing theorem states that a circle packing exists if and only if the pattern of adjacencies forms a planar graph; it was originally proved by Paul Koebe in the 1930s, and popularized by William Thurston, who rediscovered it in the 1970s and connected it with the theory of conformal maps and conformal geometry. As a topic, this should be distinguished from sphere packing, which considers higher dimensions (here, everything is two dimensional) and is more focused on packing density than on combinatorial patterns of tangency. The book is divided into four parts, in progressive levels of difficulty. The first part introduces the subject visually, encouraging the reader to think about packings not just as static objects but as dynamic systems of circles that change in predictable ways when the conditions under which they are formed (their patterns of adjacency) change. The second part concerns the proof of the circle packing theorem itself, and of the associated rigidity theorem: every maximal planar graph can be associated with a circle packing that is unique up to Möbius transformations of the plane. More generally the same result holds for any triangulated manifold, with a circle packing on a topologically equivalent Riemann surface that is unique up to conformal equivalence. The third part of the book concerns the degrees of freedom that arise when the pattern of adjacencies is not fully triangulated (it is a planar graph, but not a maximal planar graph). In this case, different extensions of this pattern to larger maximal planar graphs will lead to different packings, which can be mapped to each other by corresponding circles. The book explores the connection between these mappings, which it calls discrete analytic functions, and the analytic functions of classical mathematical analysis. The final part of the book concerns a conjecture of William Thurston, proved by Burton Rodin and Dennis Sullivan, that makes this analogy concrete: conformal mappings from any topological disk to a circle can be approximated by filling the disk by a hexagonal packing of unit circles, finding a circle packing that adds to that pattern of adjacencies a single outer circle, and constructing the resulting discrete analytic function. This part also includes applications to number theory and the visualization of brain structure. Stephenson has implemented algorithms for circle packing and used them to construct the many illustrations of the book, giving to much of this work the flavor of experimental mathematics, although it is also mathematically rigorous. Unsolved problems are listed throughout the book, which also includes nine appendices on related topics such as the ring lemma and Doyle spirals.

Audience and reception The book presents research-level mathematics, and is aimed at professional mathematicians interested in this and related topics. Reviewer Frédéric Mathéus describes the level of the material in the book as "both mathematically rigorous and accessible to the novice mathematician", presented in an approachable style that conveys the author's love of the material. However, although the preface to the book states that no background knowledge is necessary, and that the book can be read by non-mathematicians or used as an undergraduate textbook, reviewer Michele Intermont disagrees, noting that it has no exercises for students and writing that "non-mathematicians will be nothing other than frustrated with this book". Similarly, reviewer David Mumford finds the first seven chapters (part I and much of part II) to be at an undergraduate level, but writes that "as a whole, the book is suitable for graduate students in math".

Publication Stephenson, Kenneth (2005), Introduction to circle packing: the theory of discrete analytic functions, New York: Cambridge University Press, ISBN 9780521823562, OCLC 55878014

References

External links Ken Stephenson's CirclePack software

Worked examples

Example 1 — a first encounter with Introduction to Circle Packing

Start with the simplest possible case. Write down what Introduction to Circle Packing claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Introduction to Circle Packing before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Introduction to Circle Packing ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Introduction to Circle Packing

In research
Introduction to Circle Packing appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Introduction to Circle Packing in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Introduction to Circle Packing is common in secondary-school and first-year university syllabi. It links to neighbouring topics 2005 non-fiction books, Circle packing, Mathematics books, so understanding it makes those chapters shorter.
In everyday life
Look for Introduction to Circle Packing outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Introduction to Circle Packing in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Introduction to Circle Packing means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Introduction to Circle Packing out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Introduction to Circle Packing in simple terms?

Introduction to Circle Packing: The Theory of Discrete Analytic Functions is a mathematical monograph concerning systems of tangent circles and the circle packing theorem. It was written by Kenneth Stephenson and published in 2005 by the Cambridge University Press.

Why does Introduction to Circle Packing matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Introduction to Circle Packing?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Introduction to Circle Packing.

Tags

  • 2005 non-fiction books
  • Circle packing
  • Mathematics books

Keep exploring