Separators in two and three dimensions
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A polynomial time circle packing algorithm
Discrete Mathematics
Quasi-Conformally Flat Mapping the Human Cerebellum
MICCAI '99 Proceedings of the Second International Conference on Medical Image Computing and Computer-Assisted Intervention
Branched circle packings, discrete complex polynomials, and the approximation of analytic functions
Branched circle packings, discrete complex polynomials, and the approximation of analytic functions
Discrete conformal mappings via circle patterns
ACM Transactions on Graphics (TOG)
Discrete conformal mappings via circle patterns
SIGGRAPH '05 ACM SIGGRAPH 2005 Courses
Distributed computation of virtual coordinates
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Mesh parameterization methods and their applications
Foundations and Trends® in Computer Graphics and Vision
Technical Section: Layered deformation of solid model using conformal mapping
Computers and Graphics
Mesh parameterization: theory and practice
ACM SIGGRAPH ASIA 2008 courses
Discrete Curvature Flows for Surfaces and 3-Manifolds
Emerging Trends in Visual Computing
Recent Advances in Computational Conformal Geometry
Proceedings of the 13th IMA International Conference on Mathematics of Surfaces XIII
Discrete surface Ricci flow: theory and applications
Proceedings of the 12th IMA international conference on Mathematics of surfaces XII
GD'07 Proceedings of the 15th international conference on Graph drawing
On the efficiency of a local iterative algorithm to compute Delaunay realizations
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Online uniformly inserting points on grid
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Comparative analysis of quasi-conformal deformations in shape space
MICCAI'10 Proceedings of the 13th international conference on Medical image computing and computer-assisted intervention: Part III
Distributed computation of virtual coordinates for greedy routing in sensor networks
Discrete Applied Mathematics
SIAM Journal on Scientific Computing
Uniformly inserting points on square grid
Information Processing Letters
SMI 2012: Full Canonical conformal mapping for high genus surfaces with boundaries
Computers and Graphics
A generalized Malfatti problem
Computational Geometry: Theory and Applications
Pointed drawings of planar graphs
Computational Geometry: Theory and Applications
Advancing front circle packing to approximate conformal strips
Computational Geometry: Theory and Applications
Biometric encryption based on a fuzzy vault scheme with a fast chaff generation algorithm
Future Generation Computer Systems
Planar lombardi drawings for subcubic graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
The graphs of planar soap bubbles
Proceedings of the twenty-ninth annual symposium on Computational geometry
Ricci flow-based spherical parameterization and surface registration
Computer Vision and Image Understanding
Optimization of polymerase chain reaction on a cyberphysical digital microfluidic biochip
Proceedings of the International Conference on Computer-Aided Design
Deformation similarity measurement in quasi-conformal shape space
Graphical Models
| Hi-index | 0.00 |
A circle packing is a configuration P of circles realizing a specified pattern of tangencies. Radii of packings in the euclidean and hyperbolic planes may be computed using an iterative process suggested by William Thurston. We describe an efficient implementation, discuss its performance, and illustrate recent applications. A central role is played by new and subtle monotonicity results for "flowers" of circles.