arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1907.12845cs.GR
收藏

面向层次可视化的广义毕达哥拉斯树的无重叠绘制

Overlap-free Drawing of Generalized Pythagoras Trees for Hierarchy Visualization

Tanja Munz, Michael Burch, Toon van Benthem, Yoeri Poels, Fabian Beck, Daniel Weiskopf

摘要:

广义毕达哥拉斯树被开发用于可视化分层数据,产生有机的分形表示。然而,原始布局算法的缺点是视觉重叠的树枝。为了避免这种重叠,我们引入了一个适应的绘图算法,使用椭圆而不是圆递归地放置代表子层次结构的树节点。我们的技术是通过解决不同的现实世界和生成的数据集的重叠,同时将结果与原始方法进行比较。

英文摘要:

Generalized Pythagoras trees were developed for visualizing hierarchical data, producing organic, fractal-like representations. However, the drawback of the original layout algorithm is visual overlap of tree branches. To avoid such overlap, we introduce an adapted drawing algorithm using ellipses instead of circles to recursively place tree nodes representing the subhierarchies. Our technique is demonstrated by resolving overlap in diverse real-world and generated datasets, while comparing the results to the original approach.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑