Page History

...

This project is all about developing a tree layout algorithm. We pity the fool who doesn't use Mr. Tree Layout!

The general information to get you started:

...

• Sven Oliver Reimers (sor)
• Sven Gundlach (sgu)

...

The following are the main goals for this project:

• Develop a good, robust tree-based layout algorithm that can be published and shipped as part of our KLay library.
• Supply useful documentation, both on this page (project-centric) as well as on a new page in the KIELER Wiki (user-centric).

...

Page Contents

...

Each phase uses intermediate processors for small computations on the graph. The corresponding processors are defined in each phase. Some are defined multiple times, but they are invoked only once between phases.

Options

Currently only the node weighting for the node order can be changed by  the user through the option: Weighting of Nodes

...

• DESCENDANTS: The weighting of a node is the number of nodes in the subtree starting at the corresponding node.
• FAN: The weighting of a node is the maximal number of nodes in the same level of the subtree starting at the corresponding node.

Literature

Related publications:

• J. Q. Walker, II. 1990. A node-positioning algorithm for general trees. Softw. Pract. Exper. 20, 7 (July 1990)
•  A. Rusu, Rowan University, Tree drawing algorithms
• Kaufmann, M., & Wagner, D. (Eds.). (2001). Drawing graphs: methods and models (Vol. 2025). Springer
• Wetherell, C.S. and A. Shannon. Tidy Drawings of Trees. IEEE Trans- actions on Software Engineering SE-5, 5 (September 1979) 514-520.

Features

Mr.Tree is a layout algorithm that lays out a graph in a tree layout. It contains the following features:

...