12345678910 |
- The phase of placing the nodes is known to be one of the most complicated and hardest to understand from all the phases of the Sugiyama approach~\cite{sugiyama_methods_1981} for graph drawing.
- Still it is one of the most important ones: Here the actual $x$ and $y$ coordinates are assigned to all the nodes.
- Thus we develop an application that not only executes this phase, but also presents intermediate results to the user.
- \enquote{\appname} takes as input a hierarchical graph, where all nodes have been assigned to ordered layers.
- Then each stage of the node placing algorithm by Brandes and Köpf~\cite{brandes_fast_2001} can be executed step by step, either on user input or automatically with a certain delay.
- After each step the current progress of the algorithm is displayed visually.
- In chapter~\ref{ch:architecture} we provide an overview over the \appname 's architecture and chapter~\ref{ch:progress} lists the main features and their progress.
- \TODO{mention chapter 4?}
|