TU Eindhoven.
IEEE Trans Vis Comput Graph. 2013 Nov;19(11):1846-58. doi: 10.1109/TVCG.2013.76.
We present KelpFusion: a method for depicting set membership of items on a map or other visualization using continuous boundaries. KelpFusion is a hybrid representation that bridges hull techniques such as Bubble Sets and Euler diagrams and line- and graph-based techniques such as LineSets and Kelp Diagrams. We describe an algorithm based on shortest-path graphs to compute KelpFusion visualizations. Based on a single parameter, the shortest-path graph varies from the minimal spanning tree to the convex hull of a point set. Shortest-path graphs aim to capture the shape of a point set and smoothly adapt to sets of varying densities. KelpFusion fills enclosed faces based on a set of simple legibility rules. We present the results of a controlled experiment comparing KelpFusion to Bubble Sets and LineSets. We conclude that KelpFusion outperforms Bubble Sets both in accuracy and completion time and outperforms LineSets in completion time.
我们提出了 KelpFusion:一种使用连续边界在地图或其他可视化中表示项目集合成员的方法。KelpFusion 是一种混合表示形式,它融合了诸如 Bubble Sets 和 Euler 图之类的外壳技术以及诸如 LineSets 和 Kelp 图之类的基于线和基于图的技术。我们描述了一种基于最短路径图的算法来计算 KelpFusion 可视化。基于单个参数,最短路径图从最小生成树变化到点集的凸包。最短路径图旨在捕获点集的形状,并平滑地适应密度变化的集合。KelpFusion 根据一组简单的可读性规则填充封闭的面。我们介绍了一项对照实验的结果,该实验将 KelpFusion 与 Bubble Sets 和 LineSets 进行了比较。我们得出的结论是,KelpFusion 在准确性和完成时间方面均优于 Bubble Sets,在完成时间方面优于 LineSets。