Issue No. 11 - Nov. (2013 vol. 19)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TVCG.2013.76
W. Meulemans , Tech. Univ. Eindhoven, Eindhoven, Netherlands
N. H. Riche , Microsoft Res., Redmond, WA, USA
B. Speckmann , Tech. Univ. Eindhoven, Eindhoven, Netherlands
B. Alper , Univ. of California, Santa Barbara, Santa Barbara, CA, USA
T. Dwyer , Monash Univ., Caulfield East, VIC, Australia
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.
Visualization, Silicon, Resource management, Shape, Geometry, Filling, Accuracy
W. Meulemans, N. H. Riche, B. Speckmann, B. Alper and T. Dwyer, "KelpFusion: A Hybrid Set Visualization Technique," in IEEE Transactions on Visualization & Computer Graphics, vol. 19, no. 11, pp. 1846-1858, 2013.