Versions Compared

Key

  • This line was added.
  • This line was removed.
  • Formatting was changed.
Panel
titleProject Information

Related Theses:

  • Insa Fuhrmann, Layout of Compound Graphs, February 2012 (pdf)
  • Christoph Daniel Schulze, Optimizing Automatic Layout for Data Flow Diagrams, July 2011(pdf)
  • Philipp Döhring, Algorithmen zur Layerzuweisung, September 2010 (pdf)

KLay Layered is a layer-based layout algorithm mainly intended for diagrams with an inherent data flow direction. This page describes the architecture and its general architecture, while child pages discuss the different phases of the KLay Layered algorithm, as well as some notable features that may require further explanation, its intermediate processors, and other specialized topics.

Contents

Table of Contents
maxLevel2

...

In KLay Layered, we make extensive use of dummy nodes to reduce complex and very specific problems such that we can solve them using our general phases. One example is how we have implemented support for ports on the northern or southern side of a node.

Phases

This section page describes the algorithm's five main phases and the available implementations. You can find a list and descriptions of the intermediate processors below.

...