Premium
Kelp Diagrams: Point Set Membership Visualization
Author(s) -
Dinkla Kasper,
van Kreveld Marc J.,
Speckmann Bettina,
Westenberg Michel A.
Publication year - 2012
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.2012.03080.x
Subject(s) - kelp , computer science , tangent , set (abstract data type) , visualization , graph , schematic , visibility , algorithm , theoretical computer science , data mining , geometry , mathematics , ecology , electronic engineering , engineering , biology , programming language , physics , optics
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.