Graphical fisheye views

Sarkar, Manojit; Brown, Martin

doi:10.1145/198366.198384

Cited by 326 publications

(160 citation statements)

References 6 publications

Supporting

Mentioning

148

Contrasting

Unclassified

Order By: Relevance

“…For example, Yamamoto, Ozeki and Takahashi [16] explore a fisheye approach for dynamic web map services using a central region of focus surrounding the user's location, along with a "glue region" connecting the two views. Similar studies combining a global and a local view have been conducted for network maps [17] or tourist maps [18].…”

Section: Previous Workmentioning

confidence: 96%

User-Centric Time-Distance Representation of Road Networks

Kaiser

Walsh

Farmer

et al. 2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper presents a new algorithm for computing timedistance transformations of a road network based on modified multidimensional scaling. The algorithm is designed to perform on a realworld road network, and provides alternative visualisations for travel time cognition and route planning. Several extensions are explored, including user-centric and route-centric road map transformations. Our implementation of the algorithm can be applied to any locality where travel time road network data is available. Here, it is illustrated on road network data for a rural region in Ireland. Limitations of the proposed algorithm are examined, and potential solutions are discussed.

show abstract

Section: Previous Workmentioning

confidence: 96%

User-Centric Time-Distance Representation of Road Networks

Kaiser

Walsh

Farmer

et al. 2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…This is a general interaction framework for information filtering according to the user's current point of interest. This concept was later used for creating Graphical Fisheye Views (GFV) [10]. GFV is a non-linear distortion-oriented graphical visualization technique and supports multiple foci.…”

Section: Related Workmentioning

confidence: 99%

“…On the other hand, there are so-called focus+context visualization approaches that can display details in context [1], [6]. However, the existing approaches distort the data shown (e.g., fisheye views) [4], [10] or result in a large display canvas which requires scrolling (e.g., zooming in ADORA) [8].…”

Section: Introductionmentioning

confidence: 99%

FlexiView: A Magnet-Based Approach for Visualizing Requirements Artifacts

Ghazi

Seyff

Glinz

2015

Requirements Engineering: Foundation for Software Quality

View full text Add to dashboard Cite

Requirements engineers create large numbers of artifacts when eliciting and documenting requirements. They need to navigate through these artifacts and display information details at points of interest for reviewing or editing information. [Question/problem] Traditional visualization mechanisms such as scrolling and opening multiple windows lose context when navigating and can be cumbersome to use, hence. On the other hand, focus+context approaches can display details in context, but they distort the data shown (e.g., fisheye views) or result in a large display canvas which again requires scrolling (e.g., zooming in ADORA). [Principal ideas/results] We are developing a novel method for displaying just the information needed to perform an intended task. Our method partitions the available screen space into regions. The boundaries of regions are simulated with a model consisting of virtual magnetic balls and springs that behaves like a physical system. This model supports the requirements engineer in selecting how the relevant information should be displayed. [Contribution]

show abstract

“…Two other approaches to visualization of large graphs are of particular interest: fisheye views and multi-level displays. Fisheye views [14,19,22] show an area of interest quite large and detailed while showing other areas successively smaller and in less detail. Multi-level views allow us to view large graphs at multiple abstraction levels.…”

Section: Visualization Of Large Graphsmentioning

confidence: 99%

“…In this paper we present a new algorithm which allows for drawing simple undirected graphs with tens of thousands of vertices in under a minute. Even larger graphs can be displayed using this algorithm in conjunction with a fisheye view [14,19,22] or a multi-level display algorithm [7] which would allow us to accommodate graphs with more vertices than the number of pixels of the display device. However, the effectiveness of fisheye and multi-level views depends on a good recursive clustering, which in turn depends on a good initial embedding of the graph.…”

Section: Introductionmentioning

confidence: 99%

A multi-dimensional approach to force-directed layouts of large graphs*1

Gajer

2004

International Journal of Production Economics

View full text Add to dashboard Cite

Abstract. We present a novel hierarchical force-directed method for drawing large graphs. The algorithm produces a graph embedding in an Euclidean space E of any dimension. A two or three dimensional drawing of the graph is then obtained by projecting a higher-dimensional embedding into a two or three dimensional subspace of E. Projecting high-dimensional drawings onto two or three dimensions often results in drawings that are "smoother" and more symmetric. Among the other notable features of our approach are the utilization of a maximal independent set filtration of the set of vertices of a graph, a fast energy function minimization strategy, efficient memory management, and an intelligent initial placement of vertices. Our implementation of the algorithm can draw graphs with tens of thousands of vertices using a negligible amount of memory in less than one minute on a mid-range PC.

show abstract

Graphical fisheye views

Cited by 326 publications

References 6 publications

User-Centric Time-Distance Representation of Road Networks

User-Centric Time-Distance Representation of Road Networks

FlexiView: A Magnet-Based Approach for Visualizing Requirements Artifacts

A multi-dimensional approach to force-directed layouts of large graphs*1

Contact Info

Product

Resources

About