中文摘要：

为解决具有层次结构的大量信息的可视化问题,文中给出了用嵌套圆表达树型结构信息的可视化方法,即用相切的圆表示兄弟节点,嵌套的圆表示父子节点,圆的位置、大小和颜色分别表示树节点的不同属性信息.同层的兄弟节点并排排列,圆的排列算法快速、稳定、紧密且不相互重叠,排列圆的个数与时间呈线性关系,该排列算法适于大量信息的可视化,既能快速显示大数据集的整体视图,又方便查看细节信息;既能清楚地表达复杂信息间的层次关系,又能显示树节点的属性.该方法可用于文件系统的可视化,实例表明该方法简单、实用、高效、可靠.

英文摘要：

　In order to visualize large-scale hierarchical information, an approach for tree visualization using nested circles is presented. The brother nodes of the tree are represented by the circles tangent to each other. The tree nodes at different levels are represented by nested circles. The properties of nodes are described by circle′s sites, sizes and colors. Circles at the same levels are packed closely together and no overlapping. The circle packing is very fast and robust. The complexity of circle packing algorithm is nearly liner. It is suitable for visualizing large information. This visualization provides not only good overviews for large-scale information but also the details for each node. Both the complex hierarchical structures and the properties of leaf nodes are obvious. The tree visualization is used to large file systems. Examples show this approach is robust, efficient and easy to use.