Kelp Diagrams: Point Set Membership Visualization
- 25 June 2012
- journal article
- Published by Wiley in Computer Graphics Forum
- Vol. 31 (3pt1) , 875-884
Abstract
We present Kelp Diagrams, a novel method to depict set relations over points, i.e., elements with predefined positions. Our method creates schematic drawings and has been designed to take aesthetic quality, efficiency, and effectiveness into account. This is achieved by a routing algorithm, which links elements that are part of the same set by constructing minimum cost paths over a tangent visibility graph. There are two styles of Kelp Diagrams to depict overlapping sets, a nested and a striped style, each with its own strengths and weaknesses. We compare Kelp Diagrams with two existing methods and show that our approach provides a more consistent and clear depiction of both element locations and their set relations.Keywords
This publication has 18 references indexed in Scilit:
- Design Study of LineSets, a Novel Set Visualization TechniqueIEEE Transactions on Visualization and Computer Graphics, 2011
- Untangling Euler DiagramsIEEE Transactions on Visualization and Computer Graphics, 2010
- On Planar Supports for HypergraphsLecture Notes in Computer Science, 2010
- Bubble Sets: Revealing Set Relations with Isocontours over Existing VisualizationsIEEE Transactions on Visualization and Computer Graphics, 2009
- Towards realism in drawing areas of interest on architecture diagramsJournal of Visual Languages & Computing, 2009
- Interactive Visual Analysis of Set-Typed DataIEEE Transactions on Visualization and Computer Graphics, 2008
- Computational Geometry2008
- VisLink: Revealing Relationships Amongst VisualizationsIEEE Transactions on Visualization and Computer Graphics, 2007
- Visualization of areas of interest in software architecture diagrams2006
- Hypergraph planarity and the complexity of drawing venn diagramsJournal of Graph Theory, 1987