A COGNITIVE APPROACH FOR GRAPH DRAWING
- 1 January 1987
- journal article
- research article
- Published by Taylor & Francis in Cybernetics and Systems
- Vol. 18 (6), 447-488
- https://doi.org/10.1080/01969728708902150
Abstract
The effectiveness of pictorial representations (or drawings) of directed graphs is widely recognized in various fields such as system science and information science, where criteria from human visual cognition are important to evaluate the quality of drawings. This paper is devoted to consider automatic methods for drawing a finite, labeled and directed graph from a cognitive viewpoint. First, a fundamental view of this problem is presented and requirements for drawings are identified. Then the whole algorithm to realize the requirements is outlined, which consists of five steps. The first step is a preparatory one and the fourth and fifth steps have been published in other literature. Newly developed algorithms for the second and third steps are detailed and several applications also are shown.Keywords
This publication has 12 references indexed in Scilit:
- A layout algorithm for data flow diagramsIEEE Transactions on Software Engineering, 1986
- VISUAL Q-ANALYSIS (II): STRATEGY ANALYSIS FOR FUTURE COMPUTER SYSTEMS DEVELOPMENT IN JAPANCybernetics and Systems, 1983
- VISUAL Q-ANALYSIS (I): A CASE STUDY OF FUTURE COMPUTER SYSTEMS DEVELOPMENT IN JAPANCybernetics and Systems, 1983
- A method for aggregating ordinal assessments by a majority decision ruleMathematical Social Sciences, 1982
- Tidier Drawings of TreesIEEE Transactions on Software Engineering, 1981
- Methods for Visual Understanding of Hierarchical System StructuresIEEE Transactions on Systems, Man, and Cybernetics, 1981
- A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance MatricesJournal of the ACM, 1976
- Optimum Featurs and Graph IsomorphismIEEE Transactions on Systems, Man, and Cybernetics, 1974
- Topics in computer‐aided design: Part I. An optimum tearing algorithm for recycle systemsAIChE Journal, 1973
- An Efficient Computational Technique for Determination of the Cut-Set Equations of a NetworkIEEE Transactions on Circuit Theory, 1966