EventAlihan Okka

Layout algorithm for Compound Graphs with Port Constraints

Information visualization is a significant field of study that aims to represent abstract data as an aesthetically pleasing and easy to comprehend drawing. Various approaches and standards have been created to reinforce the discovery of unstructured insights that are limited to human cognition. Complex systems and processes are often modelled as data flow diagrams since that would be difficult to describe in text. A data flow diagram is a graphical representation of the “flow” of data through an information system modeling its process aspects. In these diagrams, nodes are connected to each other through dedicated connection points called ports. The influence a layout algorithm has on the placement of ports is determined by port constraints defined on the corresponding node. We propose a technique for introducing port constraints into drawing layout constrained compound graphs. We will show how our layout algorithm can be integrated with already established algorithms for minimizing edge crossing and edge routing.