Visualization of structural information: automatic drawing of compound digraphs
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics
- Vol. 21 (4) , 876-892
- https://doi.org/10.1109/21.108304
Abstract
An automatic method for drawing compound digraphs that contain both inclusion edges and adjacency edges are presented. In the method vertices are drawn as rectangles (areas for texts, images, etc.), inclusion edges by the geometric inclusion among the rectangles, and adjacency edges by arrows connecting them. Readability elements such as drawing conventions and rules are identified, and a heuristic algorithm to generate readable diagrams is developed. Several applications are shown to demonstrate the effectiveness of the algorithm. The utilization of curves to improve the quality of diagrams is investigated. A possible set of command primitives for progressively organizing structures within this graph formalism is discussed. The computational time for the applications shows that the algorithm achieves satisfactory performance.<>Keywords
This publication has 9 references indexed in Scilit:
- DAG—a program that draws directed graphsSoftware: Practice and Experience, 1988
- On visual formalismsCommunications of the ACM, 1988
- Automatic graph drawing and readability of diagramsIEEE Transactions on Systems, Man, and Cybernetics, 1988
- A browser for directed graphsSoftware: Practice and Experience, 1987
- A COGNITIVE APPROACH FOR GRAPH DRAWINGCybernetics and Systems, 1987
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1982
- Methods for Visual Understanding of Hierarchical System StructuresIEEE Transactions on Systems, Man, and Cybernetics, 1981
- Crossing Theory and Hierarchy MappingIEEE Transactions on Systems, Man, and Cybernetics, 1977
- Minimum Feedback Arc and Vertex Sets of a Directed GraphIEEE Transactions on Circuit Theory, 1966