Introduction to Circle Packing: Difference between revisions

Revision as of 01:39, 6 April 2020

Latest revision as of 06:18, 22 July 2025

(9 intermediate revisions by 6 users not shown)

Line 9:

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 function]]s 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.{{r|pokas|lord}}

Stephenson has implemented algorithms for circle packing and used them to construct the many illustrations of the book,{{r|cfp}} giving to much of this work the flavor of [[experimental mathematics]], although it is also mathematically rigorous.{{r|mumford}} Unsolved problems are listed throughout the book, which also includes nine appendices on related topics such as the [[ring lemma]] and [[Doyle spiral]]s.{{r|pokas|lord}}

==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.{{r|matheus}} 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".{{r|intermont}} 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".{{r|mumford}}

==Publication==

*{{citation

| last = Stephenson | first = Kenneth

| title = Introduction to circle packing: the theory of discrete analytic functions

| date = 2005

| publisher = Cambridge University Press

| isbn = 9780521823562

| ___location = New York

| oclc = 55878014}}

==References==

Line 27 ⟶ 37:

| pages = 63–66

| title = Review of ''Introduction to Circle Packing''

| volume = 29| s2cid = 123145356 }}</ref>

<ref name=intermont>{{citation

Line 45 ⟶ 55:

| pages = 554–556

| title = Review of ''Introduction to Circle Packing''

| volume = 90}}</ref>| s2cid = 126249069

| doi-access = free

}}</ref>

<ref name=matheus>{{citation

Line 62 ⟶ 74:

| pages = 84–86

| title = Stuff it! (Review of ''Introduction to Circle Packing'')

| volume = 94| doi = 10.1511/2006.57.84 }}</ref>

<ref name=pokas>{{citation

Line 71 ⟶ 83:

}}

== External links ==

* [http://www.math.utk.edu/~kens/CirclePack/ Ken Stephenson's CirclePack software]

[[Category:CirclesCircle packing]]

[[Category:Mathematics books]]

[[Category:2005 non-fiction books]]