结合双向正方化布局思想,提出基于均值二分法快速分块排序的正方化树图布局算法.算法使用混乱阈值和均值二分法分割原始数据集,根据数据子集权值之和的比例关系对初始矩形进行分割,在每个矩形子块内用结合长边摆放策略的正方化自适应算法排列对应的数据子集中的元素.与前面2种算法进行比较的结果表明,文中算法能够有效地减少数据集分割和排序时间,解决Squarified-SP算法分割数据集存在的多种可能性问题,同时保证整个数据集一定的顺序性且提高了数据布局的稳定性.
This paper presents a new squarified treemap layout algorithm by leveraging mean dichotomy driven blockwise sorting. The input dataset is firstly divided into several subsets by means of the mean dichotomy technique concerning the number of allowed disordered rectangles. Then the drawing area is segmented into pieces according to the total weight of each subset. Each piece is sequentially assigned to its corresponding subset by considering its weight, and is located using the squarified self-adaptive algorithm with the long-side place strategy. Compared with previous approaches, our approach effectively reduces the time of segmentation and sorting, and addresses several issues remained in data segmentation. In addition, ours maintains the order of the input data elements and improves the layout stability.