Circle Packing: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 30: | Line 30: | ||
== References == | == References == | ||
[Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press. | |||
[[Category:Techniques]] | [[Category:Techniques]] | ||
Revision as of 21:02, 23 April 2007
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
Suitable Datatypes
Example and use cases
Internal Links
References
[Wang, W. et al. 2006] Wang et al. Visualization of large hierarchical data by circle packing. In Proceedings of the SIGCHI conference on Human Factors in computing systems, pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.