Circle Packing

Authors

• Hongan Wang
  
• Guozhong Dai
  
• Weixin Wang
  
• Hui Wang
  

Short description

Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.

[Wang, W. et al., 2006]

figures

Internal Links

• Treemap

References

• [ACM, 1992] ACM, I ACM Press New York, http://portal.acm.org/citation.cfm?id=1124851&coll=GUIDE&dl=GUIDE&CFID=20762537&CFTOKEN=32865372