Kelp Diagrams: Point Set Membership Visualization

Simple item page
dc.contributor.authorDinkla, Kasperen_US
dc.contributor.authorKreveld, Marc vanen_US
dc.contributor.authorSpeckmann, Bettinaen_US
dc.contributor.authorWestenberg, Michel A.en_US
dc.contributor.editorS. Bruckner, S. Miksch, and H. Pfisteren_US
dc.date.accessioned2015-02-28T07:01:40Z
dc.date.available2015-02-28T07:01:40Z
dc.date.issued2012en_US
dc.description.abstractWe 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 relationsen_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume31
dc.identifier.doi10.1111/j.1467-8659.2012.03080.x
dc.identifier.issn1467-8659en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2012.03080.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltd.en_US
dc.titleKelp Diagrams: Point Set Membership Visualizationen_US
Files
Collections
31-Issue 3
EuroVis12: Eurographics Conference on Visualization