Methods for Visual Understanding of Hierarchical System Structures

@article{Sugiyama1981MethodsFV,
  title={Methods for Visual Understanding of Hierarchical System Structures},
  author={Kozo Sugiyama and Shojiro Tagawa and Mitsuhiko Toda},
  journal={IEEE Transactions on Systems, Man, and Cybernetics},
  year={1981},
  volume={11},
  pages={109-125}
}
Two kinds of new methods are developed to obtain effective representations of hierarchies automatically: theoretical and heuristic methods. [...] Key Method The methods determine the positions of vertices in two steps. First the order of the vertices in each level is determined to reduce the number of crossings of edges. Then horizontal positions of the vertices are determined to improve further the readability of drawings.Expand

Figures, Tables, and Topics from this paper

A layout algorithm for hierarchical graphs with constraints
A new method is developed for reducing edge crossings in the layout of directed graphs for display. The method will reduce edge crossings in graphs which have constraints on the location or movementExpand
Visualization of structural information: automatic drawing of compound digraphs
TLDR
An automatic method for drawing compound digraphs that contain both inclusion edges and adjacency edges are presented, and a heuristic algorithm to generate readable diagrams is developed. Expand
An algorithm for blob hierarchy layout
We present an algorithm for the aesthetic drawing of basic hierarchical blob structures, of the kind found in higraphs and statecharts and in other diagrams in which hierarchy is depicted asExpand
An algorithm for blob hierarchy layout
We present an algorithm for the aesthetic drawing of basic hierarchical blob structures, of the kind found in higraphs and statecharts and in other diagrams in which hierarchy is depicted asExpand
Layout heuristics for graphical representations of programs
  • P. Linos, V. Rajlich, B. Korel
  • Computer Science
  • Conference Proceedings 1991 IEEE International Conference on Systems, Man, and Cybernetics
  • 1991
TLDR
The experimental results show that the insertion method produces significantly better layouts compared to the existing methods. Expand
Drawing Order Diagrams Through Two-Dimension Extension
TLDR
This work presents the novel algorithm DimDraw, based on a relation between the dimension of an ordered set and the bipartiteness of a corresponding graph, to draw order diagrams. Expand
A Fast Heuristic for Hierarchical Manhattan Layout
  • G. Sander
  • Mathematics, Computer Science
  • Graph Drawing
  • 1995
TLDR
A fast heuristic for the layout of directed graphs according to Manhattan convention is presented, an extension of the hierarchical layout method that includes crossing reduction and emphasis on a uniform edge orientation. Expand
Maintaining the Mental Map for Circular Drawings
TLDR
The concept of hicircular drawings is introduced, a hierarchical extension of the framework for circular drawing of networks replacing the circles of single vertices by circles of circular or star-like structures. Expand
Constructing memorable asymmetric information diagrams in three dimensions
TLDR
The layout algorithm used here challenges the need for an aesthetic of symmetry in graph drawing within 3D and exploits the user’s ability to recall sub-structures within a drawing to replace edge-tracing as the means for locating nodes in the drawing. Expand
Dynamic WWW Structures in 3D
We describe a method for three-dimensional straight-line representation of dynamic directed graphs (such as parts of the World Wide Web). It has been developed on the occasion of the 1998 GraphExpand
...
1
2
3
4
5
...

References

SHOWING 1-6 OF 6 REFERENCES
Crossing Theory and Hierarchy Mapping
  • J. Warfield
  • Computer Science
  • IEEE Transactions on Systems, Man, and Cybernetics
  • 1977
Techniques are introduced which are applicable to machine construction of digraph maps. These techniques are oriented toward reduction of the number of crossings in a map as a means of improving theExpand
Minimum Feedback Arc and Vertex Sets of a Directed Graph
To determine a minimum set of arcs of an arbitrary directed graph which, if removed, leave the graph without directed circuits, is an outstanding problem in graph theory. A related problem is that ofExpand
An introduction to the application of interpretive structural modeling
TLDR
An introduction to the fundamental concepts and operations of the methodology is presented and the results of two exercises conducted with a group of graduate students who had minimal mathematical training demonstrate the utility of this methodology for capturing and communicating individual and group perceptions regarding complex issues. Expand
A method for informative approaches to analysing scientific research activities
  • 1979
Effective representations of hierarchical structures , " International Institute for Advanced Study of Social Information Science
  • IEEE Trans . Circuit Theory
  • 1966
Toward development of earthquake disaster relational model
  • Proc . Interni . Conf . Cybern . , Soc . , Nov .