Steiger, Martin ; Lücke-Tieke, Hendrik ; May, Thorsten ; Kuijper, Arjan ; Kohlhammer, Jörn (2013)
Using Layout Stitching to Create Deterministic Local Graph Layouts.
WSCG 2013. Full Papers. Proceedings.
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (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.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2013 |
| Autor(en): | Steiger, Martin ; Lücke-Tieke, Hendrik ; May, Thorsten ; Kuijper, Arjan ; Kohlhammer, Jörn |
| Art des Eintrags: | Bibliographie |
| Titel: | Using Layout Stitching to Create Deterministic Local Graph Layouts |
| Sprache: | Englisch |
| Publikationsjahr: | 2013 |
| Verlag: | University of West Bohemia, Plzen |
| Veranstaltungstitel: | WSCG 2013. Full Papers. Proceedings |
| Kurzbeschreibung (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. |
| Freie Schlagworte: | Business Field: Visual decision support, Graph visualization, Visual graph analysis, Dynamic graph layouts |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Graphisch-Interaktive Systeme |
| Hinterlegungsdatum: | 12 Nov 2018 11:16 |
| Letzte Änderung: | 12 Nov 2018 11:16 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum