Stable Treemaps via Local Moves

摘要: Treemaps are a popular tool to visualize hierarchical data: items represented by nested rectangles and the area of each rectangle corresponds data being visualized for this item. The visual quality treemap is commonly measured via aspect ratio rectangles. If changes, then second important criterion stability treemap: how much does change as changes. We present novel stable treemapping algorithm that has very high quality. Whereas existing algorithms generally recompute every time input our changes layout using only local modifications. This approach not gives us direct control over stability, but it also allows use larger set possible layouts, thus provably resulting in treemaps higher compared algorithms. further prove we can reach all layouts Furthermore, introduce new measure better captures relative positions finally show experiments on real-world outperforms practice either and/or stability. Our scores regardless whether an or measure.