packcircles-package | R Documentation |
This package provides several algorithms to find non-overlapping arrangements of circles:
Arranges circles within a bounding rectangle by pairwise repulsion.
Arranges circles in an unbounded area by progressive placement. This is a very efficient algorithm that can handle large numbers of circles.
Finds an arrangement of circles conforming to a graph specification.
Maintainer: Michael Bedward michael.bedward@gmail.com
Authors:
David Eppstein david.eppstein@gmail.com (Author of Python code for graph-based circle packing ported to C++ for this package)
Peter Menzel pmenzel@gmail.com (Author of C code for progressive circle packing ported to C++ for this package)
Useful links:
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.