%0 Journal Article %1 Sugiyama91 %A Sugiyama, K. %A Misue, K. %D 1991 %J Systems, Man and Cybernetics, IEEE Transactions on %K algorithm, automatic command compound computer curves, digraphs directed drawing, edges, geometric graph graphics, graphs, heuristic inclusion inclusion, information primitives, programmingadjacency structural theory, vertices visualisation, %N 4 %P 876--892 %R 10.1109/21.108304 %T Visualization of structural information: automatic drawing of compound digraphs %V 21 %X 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

@article{Sugiyama91, 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 }, added-at = {2009-09-21T13:52:25.000+0200}, author = {Sugiyama, K. and Misue, K.}, biburl = {https://www.bibsonomy.org/bibtex/2796cd560e858bff68e6fdf72daf6187a/taynaud}, doi = {10.1109/21.108304}, interhash = {49d6d67b2f9b20b9ac4391c3cebd3481}, intrahash = {796cd560e858bff68e6fdf72daf6187a}, issn = {0018-9472}, journal = {Systems, Man and Cybernetics, IEEE Transactions on}, keywords = {algorithm, automatic command compound computer curves, digraphs directed drawing, edges, geometric graph graphics, graphs, heuristic inclusion inclusion, information primitives, programmingadjacency structural theory, vertices visualisation,}, month = {Jul/Aug}, number = 4, pages = {876--892}, timestamp = {2009-09-21T13:52:29.000+0200}, title = {Visualization of structural information: automatic drawing of compound digraphs}, volume = 21, year = 1991 }