TU Darmstadt / ULB / TUbiblio

Deterministic Local Layouts through High-Dimensional Layout Stitching

Steiger, Martin ; Lücke-Tieke, Hendrik ; May, Thorsten ; Kuijper, Arjan ; Kohlhammer, Jörn (2014)
Deterministic Local Layouts through High-Dimensional Layout Stitching.
Human-Computer Interaction: Part 1.
doi: 10.1007/978-3-319-07233-3_59
Konferenzveröffentlichung, Bibliographie

Kurzbeschreibung (Abstract)

In this paper we present a layout technique for dynamic views of large static graphs. It aims to minimize changes between two consecutive frames and most importantly, it is deterministic. First, a set of small layout patches is pre-computed. Then, depending on the users view focus, a subset of these patches is selected and connected to generate the final layout. In contrast to the state-of-the-art approach that operates in the 2D screen space only, we perform this process in high-dimensional space before projecting the results into the 2D plane. This gives additional degrees of freedom and consequently a smoother transition process between two consecutive frames. Whenever the user visits an area of the graph for a second time, the layout will still look the same. This enables the user to recognize areas that have already been explored and thus preserve the mental map.

Typ des Eintrags: Konferenzveröffentlichung
Erschienen: 2014
Autor(en): Steiger, Martin ; Lücke-Tieke, Hendrik ; May, Thorsten ; Kuijper, Arjan ; Kohlhammer, Jörn
Art des Eintrags: Bibliographie
Titel: Deterministic Local Layouts through High-Dimensional Layout Stitching
Sprache: Englisch
Publikationsjahr: 2014
Verlag: Springer, Berlin, Heidelberg, New York
Reihe: Lecture Notes in Computer Science (LNCS); 8510
Veranstaltungstitel: Human-Computer Interaction: Part 1
DOI: 10.1007/978-3-319-07233-3_59
Kurzbeschreibung (Abstract):

In this paper we present a layout technique for dynamic views of large static graphs. It aims to minimize changes between two consecutive frames and most importantly, it is deterministic. First, a set of small layout patches is pre-computed. Then, depending on the users view focus, a subset of these patches is selected and connected to generate the final layout. In contrast to the state-of-the-art approach that operates in the 2D screen space only, we perform this process in high-dimensional space before projecting the results into the 2D plane. This gives additional degrees of freedom and consequently a smoother transition process between two consecutive frames. Whenever the user visits an area of the graph for a second time, the layout will still look the same. This enables the user to recognize areas that have already been explored and thus preserve the mental map.

Freie Schlagworte: Business Field: Visual decision support, Research Area: Computer graphics (CG), Research Area: Human computer interaction (HCI), Dynamic graph layouts, Mental maps, Data exploration
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 Frage zum Eintrag

Optionen (nur für Redakteure)
Redaktionelle Details anzeigen Redaktionelle Details anzeigen