circlepack#

CirclePack.py Compute circle packings according to the Koebe-Thurston-Andreev theory, Following data numerical algorithm by C. R. Collins and K. Stephenson, “A Circle Packing Algorithm”, Comp. Geom. Theory and Appl. 2003.

AUTHORS: …

Functions

`CirclePack`(internal, external)	Find a circle packing for the given data.
`InvertAround`(packing, k[, smallCircles])	Invert so that the specified circle surrounds all the others.
`InvertPacking`(packing, center)	Invert with specified center
`NormalizePacking`(packing[, k, target])	Make the given circle have radius one (or the target if given).
`acxyz`(x, y, z)	Angle at a circle of radius x given by two circles of radii y and z
`flower`(radius, center, cycle)	Compute the angle sum around a given internal circle
`place`(placements, radii, internal, center)	Recursively find centers of all circles surrounding k
`testgrid`(packing, k, z, r, q, g)	Build grid of test points around q with grid size g