Layout Adjustment and the Mental Map

Misue, Kazuo; Eades, Peter; Lai, Wei; Sugiyama, K.

doi:10.1006/jvlc.1995.1010

Cited by 429 publications

(297 citation statements)

References 0 publications

Supporting

Mentioning

296

Contrasting

Unclassified

Order By: Relevance

“…Misue, et al [2] have independently discovered the same transformation which we apply. They dismiss the transformation as inappropriate for their display as it tends to compress areas at great distances to single points and does not preserve orthogonal ordering of nodes in the polar case.…”

Section: Related Workmentioning

confidence: 97%

A simple algorithm for drawing large graphs on small screens

1995

View full text Add to dashboard Cite

Abstract. Viewing a large graph in limited display space has traditionally been accomplished using either reduced scale rendering of the graph or by attaching scrollbars to a view window which shows only a small portion of the entire graph. Recent work, however, has concentrated on integrating a locally detailed view with a globally scaled view. We present an algorithm for constructing a view which smoothly integrates local detail and global context in a single view window and describe user interaction with such a display.

show abstract

Section: Related Workmentioning

confidence: 97%

A simple algorithm for drawing large graphs on small screens

1995

View full text Add to dashboard Cite

show abstract

“…This technique describes, which most of existing visualization systems have problems presenting, huge graphs like fish-eye [26], hyperbolic browser, cone trees [23]. The main issue of this technique is zero angular resolution problem i.e.…”

Section: Graph Drawing Aesthetics and Layoutsmentioning

confidence: 99%

“…Literature indicates that several research initiatives have targeted 2D and 3D ontology visualization techniques [16,7,3,29,22,14,6,8,9,23,17,10,31,11,13,19]. Several tools exist to visualize the semantic nets [20].…”

Section: Introductionmentioning

confidence: 99%

Scalable Visualization of Semantic Nets using Power-Law Graphs

Hussain¹,

Latif²,

Rextin³

et al. 2014

Appl. Math. Inf. Sci.

View full text Add to dashboard Cite

Scalability and performance implications of semantic net visualization techniques are open research challenges. This paper focuses on developing a visualization technique that mitigates these challenges. We present a novel approach that exploits the underlying concept of power-law degree distribution as many realistic semantic nets seems to possess a power law degree distribution and present a small world phenomenon. The core concept is to partition the node set of a graph into power and non-power nodes and to apply a modified force-directed method that emphasizes the power nodes which results in establishing local neighborhood clusters among power nodes. We also made refinements in conventional force-directed method by tuning the temperature cooling mechanism in order to resolve 'local-minima' problem. To avoid cluttered view, we applied semantic filtration on nodes, ensuring zero loss of semantics. Results show that our technique handles very large scale semantic nets with a substantial performance improvement while producing aesthetically pleasant layouts. A visualization tool, NavigOWL, is developed by using this technique which has been ported as a plug-in for Protege, a famous ontology editor.

show abstract

“…He applies his concepts to the drawing of dynamic directed acyclic graphs. Misue et al [MELS95] introduce the concept of mental distance. It formally describes the difference of two layouts and can be used to measure the perceived stability of a dynamic graph layout.…”

Section: Related Workmentioning

confidence: 99%

Visualization of Barrier Tree Sequences Revisited

Heine

Scheuermann

Flamm

et al. 2008

Mathematics and Visualization

View full text Add to dashboard Cite

Summary. The increasing complexity of models for prediction of the native spatial structure of RNA molecules requires visualization methods that help to analyze and understand the models and their predictions. This paper improves the visualization method for sequences of barrier trees previously published by the authors. The barrier trees of these sequences are rough topological simplifications of changing folding landscapes -energy landscapes in which kinetic folding takes place. The folding landscapes themselves are generated for RNA molecules where the number of nucleotides increases. Successive landscapes are thus correlated and so are the corresponding barrier trees. The landscape sequence is visualized by an animation of a barrier tree that changes with time.The animation is created by an adaption of the foresight layout with tolerance algorithm for dynamic graph layout problems. Since it is very general, the main ideas for the adaption are presented: construction and layout of a supergraph, and how to build the final animation from its layout. Our previous suggestions for heuristics lead to visually unpleasing results for some datasets and, generally, suffered from a poor usage of available screen space. We will present some new heuristics that improve the readability of the final animation.

show abstract

Layout Adjustment and the Mental Map

Cited by 429 publications

References 0 publications

A simple algorithm for drawing large graphs on small screens

A simple algorithm for drawing large graphs on small screens

Scalable Visualization of Semantic Nets using Power-Law Graphs

Visualization of Barrier Tree Sequences Revisited

Contact Info

Product

Resources

About