Abstract
In this paper, we explore the problem of producing process diagrams and introduce a linear time technique for creating them. Each edge has at most 3 bends and portions of the edge routing have optimal height. While developing a solution, we explore the subproblems of determining the order of the layers in the diagram, assigning x and y coordinates to nodes, and routing the edges.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
T. H. Cormen, C. E. Leiserson and R. L. Rivest, Introduction to Algorithms, McGraw-Hill, 1990.
G. Di Battista, P. Eades, R. Tamassia and I. G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice-Hall, 1999.
P. Eades, X. Lin and W. F. Smyth, A Fast and Effective Heuristic for the Feedback Arc Set Problem, Information Processing Letters, 47, pp. 319–323, 1993.
P. Eades and X. Lin, A New Heuristic for the Feedback Arc Set Problem, Australian Jrnl. of Combinatorics, 12, pp. 15–26, 1995.
M. V. Farino, Flowcharting, Prentice-Hall, 1970.
M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, 1979.
GRADE User Manual, Infologistik GmbH, 2000. Also available at http://www.gradetools.com.
U. I. Gupta, D. T. Lee and J. Y.-T. Leung, An Optimal Solution for the Channel Assignment Problem, IEEE Trans. Computers, C-28(11), pp.807–810, 1979.
A. Hashimoto and J. Stevens, Wire Routing by Optimizing Channel Assignment with Large Apertures, Proc. 8th ACM/IEEE Design Automation Workshop, pp. 155–169, 1971.
G. Isaak, Tournaments as Feedback Arc Sets, Electronic Jrnl. of Combinatorics, 2(1), #R20, 1995. Also available at http://www.combinatorics.org.
P. Kikusts and P. Rucevskis, Layout Algorithms of Graph-Like Diagrams for GRADE Windows Graphic Editors, Proc. of GD’ 95, LNCS 1027, Springer-Verlag, pp. 361–364, 1996.
D. E. Knuth, Computer Drawn Flowcharts, Comm. of the ACM, 6(9), 1963.
A. S. La Paugh, Algorithms for Integrated Circuit Layout: An Analytic Approach, PhD Thesis, Massachusettes, 1980.
T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, John Wiley and Sons, 1990.
J. Martin and C. McClure, Diagramming Techniques for Analysts and Programmers, Prentice-Hall, 1985.
A. Papakostas, Information Visualization: Orthogonal Drawings of Graphs, Ph.D. Thesis, The University of Texas at Dallas, 1996.
K. Ryall, J. Marks, and S. Shieber, An Interactive System for Drawing Graphs, Proc. GD’ 96, LNCS 1190, Springer-Verlag, pp. 387–94, 1997.
G. Sander, A Fast Heuristic for Hierarchical Manhattan Layout, Proc. GD’ 95, vol 1027 of LNCS, pp. 447–458, Springer-Verlag, 1996.
J. M. Six, VisTool: A Tool For Visualizing Graphs, Ph.D. Thesis, The University of Texas at Dallas, 2000.
K. Sugiyama, S. Tagawa and M. Toda, Methods for Visual Understanding of Hierarchical Systems, IEEE Trans. Systems, Man and Cybernetics, SMC-11, no. 2, pp. 109–125, 1981.
R. Tamassia, On Embedding a Graph in the Grid with the Minimum Number of Bends, SIAM J. Comput., 16, pp. 421–444, 1987.
K. Wittenburg and L. Weitzman, Qualitative Visualization of Processes: Attributed Graph Layout and Focusing Techniques, Proc. GD’ 96, LNCS 1190, Springer-Verlag, pp. 401–8, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Six, J.M., Tollis, I.G. (2002). Automated Visualization of Process Diagrams. In: Mutzel, P., Jünger, M., Leipert, S. (eds) Graph Drawing. GD 2001. Lecture Notes in Computer Science, vol 2265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45848-4_4
Download citation
DOI: https://doi.org/10.1007/3-540-45848-4_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43309-5
Online ISBN: 978-3-540-45848-7
eBook Packages: Springer Book Archive