146:
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
122:, 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.
105:
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,
81:
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
145:
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
45:
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
150:
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".
106:
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
129:, although it is also mathematically rigorous. Unsolved problems are listed throughout the book, which also includes nine appendices on related topics such as the
125:
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
82:
are formed (their patterns of adjacency) change. The second part concerns the proof of the circle packing theorem itself, and of the associated
247:
169:
471:
381:
372:
466:
34:
273:
126:
91:
461:
74:, which considers higher dimensions (here, everything is two dimensional) and is more focused on
83:
47:
30:
111:
430:
421:
87:
222:
8:
398:
348:
331:
300:
292:
67:
50:
states that a circle packing exists if and only if the pattern of adjacencies forms a
402:
304:
175:
165:
107:
390:
340:
282:
218:
59:
114:. The final part of the book concerns a conjecture of William Thurston, proved by
426:
368:
119:
99:
75:
26:
71:
287:
455:
322:
147:
63:
446:
179:
134:
115:
51:
162:
Introduction to circle packing: the theory of discrete analytic functions
18:
Introduction to Circle
Packing: The Theory of Discrete Analytic Functions
352:
296:
94:
of the plane. More generally the same result holds for any triangulated
394:
344:
130:
62:, who rediscovered it in the 1970s and connected it with the theory of
55:
22:
33:. It was written by Kenneth Stephenson and published in 2005 by the
95:
213:
90:
can be associated with a circle packing that is unique up to
98:, with a circle packing on a topologically equivalent
453:
367:
70:. As a topic, this should be distinguished from
325:(January–February 2006), "Stuff it! (Review of
238:Intermont, Michele (December 2005), "Review of
102:that is unique up to conformal equivalence.
78:than on combinatorial patterns of tangency.
233:
231:
159:
317:
315:
313:
286:
237:
140:
228:
164:, New York: Cambridge University Press,
414:
375:; Parry, W. R. (June 2007), "Review of
321:
267:Lord, Nick (November 2006), "Review of
202:
200:
198:
196:
454:
408:
310:
262:
260:
258:
256:
415:Mathéus, Frédéric (2006), "Review of
363:
361:
447:Ken Stephenson's CirclePack software
266:
193:
253:
248:Mathematical Association of America
13:
358:
14:
483:
440:
206:
58:in the 1930s, and popularized by
417:Introduction to Circle Packing
382:The Mathematical Intelligencer
377:Introduction to Circle Packing
327:Introduction to Circle Packing
269:Introduction to Circle Packing
240:Introduction to Circle Packing
209:Introduction to Circle Packing
207:Pokas, Serguey M., "Review of
153:
54:; it was originally proved by
1:
186:
160:Stephenson, Kenneth (2005),
7:
10:
488:
35:Cambridge University Press
288:10.1017/S0025557200180726
40:
274:The Mathematical Gazette
127:experimental mathematics
472:2005 non-fiction books
141:Audience and reception
92:Möbius transformations
48:circle packing theorem
31:circle packing theorem
25:concerning systems of
112:mathematical analysis
422:Mathematical Reviews
88:maximal planar graph
395:10.1007/bf02985693
345:10.1511/2006.57.84
332:American Scientist
108:analytic functions
68:conformal geometry
21:is a mathematical
467:Mathematics books
479:
434:
433:
412:
406:
405:
365:
356:
355:
319:
308:
307:
290:
281:(519): 554–556,
264:
251:
250:
235:
226:
225:
204:
182:
84:rigidity theorem
60:William Thurston
487:
486:
482:
481:
480:
478:
477:
476:
452:
451:
443:
438:
437:
413:
409:
366:
359:
320:
311:
265:
254:
236:
229:
205:
194:
189:
172:
156:
143:
120:Dennis Sullivan
100:Riemann surface
76:packing density
43:
27:tangent circles
12:
11:
5:
485:
475:
474:
469:
464:
462:Circle packing
450:
449:
442:
441:External links
439:
436:
435:
407:
357:
323:Mumford, David
309:
252:
227:
191:
190:
188:
185:
184:
183:
170:
155:
152:
142:
139:
72:sphere packing
64:conformal maps
42:
39:
9:
6:
4:
3:
2:
484:
473:
470:
468:
465:
463:
460:
459:
457:
448:
445:
444:
432:
428:
424:
423:
418:
411:
404:
400:
396:
392:
388:
384:
383:
378:
374:
370:
369:Cannon, J. W.
364:
362:
354:
350:
346:
342:
338:
334:
333:
328:
324:
318:
316:
314:
306:
302:
298:
294:
289:
284:
280:
276:
275:
270:
263:
261:
259:
257:
249:
245:
241:
234:
232:
224:
220:
216:
215:
210:
203:
201:
199:
197:
192:
181:
177:
173:
171:9780521823562
167:
163:
158:
157:
151:
149:
148:David Mumford
138:
136:
135:Doyle spirals
132:
128:
123:
121:
117:
113:
110:of classical
109:
103:
101:
97:
93:
89:
85:
79:
77:
73:
69:
65:
61:
57:
53:
49:
38:
36:
32:
28:
24:
20:
19:
420:
416:
410:
389:(3): 63–66,
386:
380:
376:
373:Floyd, W. J.
339:(1): 84–86,
336:
330:
326:
278:
272:
268:
243:
239:
212:
208:
161:
144:
124:
116:Burton Rodin
104:
80:
52:planar graph
44:
17:
16:
15:
244:MAA Reviews
154:Publication
456:Categories
223:1074.52008
187:References
131:ring lemma
56:Paul Koebe
403:123145356
305:126249069
23:monograph
353:27858719
297:40378239
180:55878014
96:manifold
86:: every
29:and the
431:2131318
429:
401:
351:
303:
295:
221:
214:zbMATH
178:
168:
41:Topics
399:S2CID
349:JSTOR
301:S2CID
293:JSTOR
329:)",
176:OCLC
166:ISBN
133:and
118:and
66:and
419:",
391:doi
379:",
341:doi
283:doi
271:",
242:",
219:Zbl
211:",
458::
427:MR
425:,
397:,
387:29
385:,
371:;
360:^
347:,
337:94
335:,
312:^
299:,
291:,
279:90
277:,
255:^
246:,
230:^
217:,
195:^
174:,
137:.
37:.
393::
343::
285::
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.