Title: Using Layout Stitching to create deterministic Local Graph Layouts
Authors: Steiger, Martin
Lücke-Tieke, Hendrik
May, Thorsten
Kuijper, Arjan
Kohlhammer, Jörn
Citation: WSCG 2013: Full Papers Proceedings: 21st International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision in cooperation with EUROGRAPHICS Association, p. 1-9.
Issue Date: 2013
Publisher: Václav Skala - UNION Agency
Document type: conferenceObject
konferenční příspěvek
URI: http://wscg.zcu.cz/WSCG2013/!_2013-WSCG-Full-proceedings.pdf
http://hdl.handle.net/11025/6990
ISBN: 978-80-86943-74-9
Keywords: dynamický graf;explorativní analýza;mentální mapa
Keywords in different language: dynamic graph;explorative analysis;mental map
Abstract: Dynamic graph layouts are often used to position nodes in local views of large graphs. These layouts can be optimized to minimize changes when navigating to other parts of the graph. Dynamic graph layout techniques do not, however, guarantee that a local layout is recognizable when the user visits the same area twice. In this paper we present a method to create stable and deterministic layouts of dynamic views of large graphs. It is based on a well-known panorama-stitching algorithm from the image processing domain. Given a set of overlapping photographs it creates a larger panorama that combines the original images. In analogy to that our algorithm stitches pre-computed layouts of subgraphs to form a larger, single layout. This deterministic approach makes structures and node locations persistent which creates identical visual representations of the graph. This enables the user to recognize previously encountered parts and to decide whether a certain part of a dataset has already been explored before or not.
Rights: © Václav Skala - UNION Agency
Appears in Collections:WSCG 2013: Full Papers Proceedings

Files in This Item:
File Description SizeFormat 
Steiger.pdfPlný text3,5 MBAdobe PDFView/Open


Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/6990

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.