Visualization of varying hierarchies by stable layout of voronoi treemaps

摘要: Space-restricted techniques for visualizing hierarchies generally achieve high scalability and readability (e.g., tree maps, bundle views, sunburst). However, the visualization layout directly depends on hierarchy, that is, small changes to hierarchy can cause wide-ranging layout. For this reason, it is difficult use these compare similar variants of a because users are confronted with layouts do not expose expected similarity. Voronoi treemaps appear be promising candidates overcome limitation. existing treemap algorithms provide deterministic or assume fixed hierarchy. In paper we present an extended algorithm provides degree similiarity varying hierarchies, such as software-system hierarchies. The implementation uses initial-distribution approach reduces variation in node positioning even if underlying data occur. Compared algorithms, our achieves lower error rates respect areas case weighted diagrams, which show comparative study.