Latour — A Tree Visualisation System
Lecture notes in computer sciencePublished 1 January 1999
Iván Herman, Guy Mélançon, Maurice M. de Ruiter, Maylis Delest
Citations18
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper presents some of the most important features of a tree visualisation system called Latour, developed for the purposes of information visualisation, which includes the provision for visual cues based on complexity metrics on graphs.
Abstract
This paper presents some of the most important features of a tree visualisation system called Latour, developed for the purposes of information visualisation. This system includes a number of interesting and unique characteristics, for example the provision for visual cues based on complexity metrics on graphs, which represent general principles that, in our view, graph based information visualisation systems should generally offer.
Keywords
Computer Science
Graph Drawing: Algorithms for the Visualization of Graphs
1,996 Citations1998Giuseppe Di Battista, Peter Eades +2 more
Cone Trees
1,159 Citations1991George G. Robertson, Jock D. Mackinlay +1 more
This work describes one of these Information Visualtzaiion techniques, called the Cone Tree, which is used for visualizing hierarchical information structures, where the hierarchy is presented in 3D to make effective use of available screen space and enable visualization of the whole structure.
A focus+context technique based on hyperbolic geometry for visualizing large hierarchies
892 Citations1995John Lamping, Ramana Rao +1 more
The essence of this scheme is to lay out the hierarchy in a uniform way on a hyperbolic plane an d map this plane onto a circular display region that supports a smooth blending between focus and context, as well as continuous redirection of the focus.
Computational GeometryAlgorithms for drawing graphs: an annotated bibliography
860 Citations1994Giuseppe Di Battista, Peter Eades +2 more
A bibliographic survey on algorithms whose goal is to produce aesthetically pleasing drawings of graphs is presented, a first attempt to encompass both theoretical and application-oriented papers from disparate areas.
Journal of Visual Languages & ComputingLayout Adjustment and the Mental Map
542 Citations1995Kazuo Misue, Peter Eades +2 more
This paper discusses some layout adjustment methods and the preservation of the 'mental map' of the diagram, and two kinds of layout adjustments are described, an algorithm for rearranging a diagram to avoid overlapping nodes and a method aimed at changing the focus of interest of the user without destroying the mental map.
IEEE Transactions on Software EngineeringTidier Drawings of Trees
503 Citations1981Edward M. Reingold, J.S. Tilford
It is shown that various algorithms for producing tidy drawings of trees contain some difficulties that lead to aesthetically unpleasing, wider than necessary drawings, and a new algorithm is presented with comparable time and storage requirements that produces tidier drawings.
Lecture notes in computer scienceWhich aesthetic has the greatest effect on human understanding?
484 Citations1997Helen C. Purchase
In the creation of graph drawing algorithms and systems, designers claim that by producing layouts that optimise certain aesthetic qualities, the graphs are easier to understand.
Communications of the ACMGraphical fisheye views
421 Citations1994Manojit Sarkar, Marc H. Brown
This paper describes a system for viewing and browsing graphs using a software analog of a fisheye lens and describes a more general transformation that allows global information about the graph to affect the view.
H3: laying out large directed graphs in 3D hyperbolic space
287 Citations2002Tamara Munzner
The H3 layout technique for drawing large directed graphs as node-link diagrams in 3D hyperbolic space is presented and its implementation accommodates navigation through graphs too large to be rendered interactively by allowing the user to explicitly prune or expand subtrees.
Software Practice and ExperienceA node‐positioning algorithm for general trees
154 Citations1990John Q. Walker
The algorithm described in this paper is concerned with the first stage: given a list of nodes, an indication of the hierarchical relationship among them, and their shape and size, where should each node be positioned for optimal aesthetic effect?
Random Structures and AlgorithmsSystems of functional equations
140 Citations2000Michael Drmota
The aim of this paper is to discuss the asymptotic properties of the coefficients of generating functions which satisfy a system of functional equations and it turns out that under certain general conditions these coefficients are related to the distribution of a multivariate random variable that is asymptonically normal.
Research report. Interacting with huge hierarchies: beyond cone trees
102 Citations2002Jeromy Carrière, Rick Kazman
The paper describes a system called fsviz which visualizes arbitrarily large hierarchies while retaining user control by augmenting cone trees with several graphical and interaction techniques, and improves upon earlier cone tree visualization systems through a more elaborate node layout algorithm.
Lecture notes in computer scienceDemonstration of the interactive graph visualization system da Vinci
78 Citations1995Michael Fröhlich, Mattias Werner
The graph visualization system da Vinci is presented, an interactive tool that can be used by arbitrary application programs as a user interface for graph data structures and offers many interactive facilities such as finetuning of a layout, abstractions and scaling operations.
Dynamic aggregation with circular visual designs
76 Citations2002Mei C. Chuah
This integration hopes to provide effective support for the aggregation process by enabling automatic aggregation, continuous change and control of the aggregation level, spatially based aggregates, context maintenance across different aggregate levels, and feedback on the level of aggregation.
Lecture notes in computer scienceNicheWorks — Interactive visualization of very large graphs
67 Citations1997Graham Wills
A tool is described that addresses the needs of investigating and exploring large, complex data sets and is able to display both graph structure and node and edge attributes so that patterns and information hidden in the data can be seen.
Computer Graphics ForumTree Visualisation and Navigation Clues for Information Visualisation
46 Citations1998Iván Herman, Maylis Delest +1 more
This paper describes a visual clue: using the so‐called Strahler numbers, a map is provided that indicates which parts of the tree are interesting, and a second idea is that of “folding” away subtrees that are too “different” in some sense, thereby reducing the visual complexity of theTree.
Computer Networks and ISDN SystemsWebOFDAV — navigating and visualizing the Web on-line with animated context swapping
42 Citations1998Mao Lin Huang, Peter Eades +1 more
A novel navigation approach that helps the user, not only by providing a visual aid to guide the Web journey, but also by preserving the user's mental map of the view while the user interactively navigates the Web by swapping of views.
Lecture notes in computer scienceLatour — A Tree Visualisation System
18 Citations1999Iván Herman, Guy Mélançon +2 more
This paper presents some of the most important features of a tree visualisation system called Latour, developed for the purposes of information visualisation, which includes the provision for visual cues based on complexity metrics on graphs.