TU Darmstadt / ULB / TUbiblio

Deterministic Local Layouts through High-Dimensional Layout Stitching

Steiger, Martin and Lücke-Tieke, Hendrik and May, Thorsten and Kuijper, Arjan and Kohlhammer, Jörn (2014):
Deterministic Local Layouts through High-Dimensional Layout Stitching.
Springer, Berlin, Heidelberg, New York, In: Human-Computer Interaction: Part 1, In: Lecture Notes in Computer Science (LNCS); 8510, DOI: 10.1007/978-3-319-07233-3₅₉,
[Conference or Workshop Item]

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.

Item Type: Conference or Workshop Item
Erschienen: 2014
Creators: Steiger, Martin and Lücke-Tieke, Hendrik and May, Thorsten and Kuijper, Arjan and Kohlhammer, Jörn
Title: Deterministic Local Layouts through High-Dimensional Layout Stitching
Language: English
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.

Series Name: Lecture Notes in Computer Science (LNCS); 8510
Publisher: Springer, Berlin, Heidelberg, New York
Uncontrolled Keywords: Business Field: Visual decision support, Research Area: Computer graphics (CG), Research Area: Human computer interaction (HCI), Dynamic graph layouts, Mental maps, Data exploration
Divisions: 20 Department of Computer Science
20 Department of Computer Science > Interactive Graphics Systems
Event Title: Human-Computer Interaction: Part 1
Date Deposited: 12 Nov 2018 11:16
DOI: 10.1007/978-3-319-07233-3₅₉
Export:

Optionen (nur für Redakteure)

View Item View Item