How to Draw a Sequence Diagram

In this paper, we consider the aesthetic criteria and constraints related to the layouts of UML sequence diagrams. We consider the applicability of the traditional graph drawing aesthetics in drawing sequence diagrams. Because of the special nature of sequence diagrams, many of these aesthetics are not applicable. Based on our view on how these diagrams are read or viewed, we propose some new aesthetics. We also take into account the presence of usually adopted conventions and constraints. The basic choice in producing a drawing for a sequence diagram is the linear order of the participating objects. Based on this finding and the identified aesthetics criteria, we formulate some related computational problems.

[1]  Ivar Jacobson,et al.  The unified modeling language reference manual , 2010 .

[2]  Alan M. Frieze,et al.  A new rounding procedure for the assignment problem with applications to dense graph arrangement problems , 2002, Math. Program..

[3]  Alan M. Frieze,et al.  A new rounding procedure for the assignment problem with applications to dense graph arrangement problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[4]  D. Adolphson.  Optimal linear-ordering. , 1973 .

[5]  David A. Carrington,et al.  Graph Layout Aesthetics in UML Diagrams: User Preferences , 2002, J. Graph Algorithms Appl..

[6]  Christos H. Papadimitriou,et al.  The NP-Completeness of the bandwidth minimization problem , 1976, Computing.

[7]  Richard J. Lipton,et al.  A method for drawing graphs , 1985, SCG '85.

[8]  Sang Ho Lee,et al.  Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions , 1998, GD.

[9]  Walter Unger,et al.  The complexity of the approximation of the bandwidth problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[10]  David S. Johnson,et al.  COMPLEXITY RESULTS FOR BANDWIDTH MINIMIZATION , 1978 .

[11]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[12]  Yossi Shiloach,et al.  A Minimum Linear Arrangement Algorithm for Undirected Trees , 1979, SIAM J. Comput..

[13]  JOSEP DÍAZ,et al.  A survey of graph layout problems , 2002, CSUR.

[14]  Ioannis G. Tollis,et al.  Graph Drawing , 1994, Lecture Notes in Computer Science.

[15]  Mikhail J. Atallah,et al.  Fast Detection and Display of Symmetry in Trees , 1985 .

[16]  K F.R.,et al.  ON OPTIMAL LINEAR ARRANGEMENTS OF TREES , 1983 .

[17]  Joseph Manning,et al.  Computational Complexity of Geometric Symmetry Detection in Graphs , 1989, Great Lakes Computer Science Conference.

[18]  Ralph Johnson,et al.  design patterns elements of reusable object oriented software , 2019 .

[19]  Carlo Batini,et al.  Automatic graph drawing and readability of diagrams , 1988, IEEE Trans. Syst. Man Cybern..

[20]  Carlo Batini,et al.  What is a good diagram , 1985 .

[21]  Dieter Jungnickel,et al.  Graphs, Networks, and Algorithms , 1980 .

[22]  Robert F. Cohen,et al.  Validating Graph Drawing Aesthetics , 1995, GD.

[23]  Joseph Naor,et al.  Divide-and-conquer approximation algorithms via spreading metrics , 2000, JACM.

[24]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[25]  Joe Marks,et al.  Automating the layout of network diagrams with specified visual organization , 1994, IEEE Trans. Syst. Man Cybern..