...
| Deadline | Milestone |
|---|---|
2013-05-02 2013-05-10 | Review tree layout methods and make a first decision on which ones are to be implemented. Presentation in weekly meeting. Create and implement the start of the MrTGraph data structure. Presentation in weekly meeting. |
Literature Review
| Info | ||
|---|---|---|
| ||
Start by reading the papers Miro has already sent you. Going from there, decide what you'd like to implement and possibly read further papers. Collect paper references in this section so that you (and we) will be able to find them again. |
...
- J. Q. Walker, II. 1990. A node-positioning algorithm for general trees. Softw. Pract. Exper. 20, 7 (July 1990), http://www.cs.unc.edu/techreports/89-034.pdf
Architecture
| Info | ||
|---|---|---|
| ||
You will have to think about how you are going to implement your algorithm. One possible architecture is to divide the work of the algorithm into sub-algorithms, called phases. This makes it easy to provide different implementations of phases that result in different kinds of tree layouts. KLay Layered uses this approach. You can find some documentation about this approach on its Confluence page. Further information can be found in a paper we just wrote, but haven't published yet. If you are interested in reading it, feel free to ask for a copy of the paper. Remember: This will probably not be the only possibility for structuring your algorithm. Also remember: What starts with a first small and simple implementation will grow into a much more complex algorithm, with possibilities for customizing the result and different kinds of layouts that are computed. Design your architecture with this kind of complexity in mind. Feel free to talk to us once you've settled on an architecture. |
...