Meeting Details

• Moderator: msp
• Protocol: sor
• Attendees:
  
  • msp
  • sgu
  • sor
• Start: 14:15
• End: 15:30

Agenda

Demos

Working tree algorithm (sgu)

sgu demos the working tree algorithm with correct nodeplacer and showed some working layout examples.

Stated that previous bugs in nodeplacer also came from mistakes in pseudocode written by Walker et al. in referenced paper.

msp wanted to make sure that checkstyle was used.

Confluence Page (sor)

• showed and explained updated confluence page

Proposed Extensions for Code (msp)

• direction processor
• use the word 'Treeifying' instead of 'Treeing' and name the corresponding algorithm phase 'DFSTreeifyer'
• more complex edge routing
• why coordinates processor? nodeplacer might set coordinates

Proposed Extensions for Page (msp)

• add the information WHEN WHICH intermediate processor comes into play
• Treeifying

TODO

• Mark mistakes (and our corrections) that came from pseudocode used in referenced paper
• Debug/clean up code
• Comment code
• Edit/extend confluence page

Programming at beamer (msp/sor/sgu)

• rewrote the DFSTreeifying class, so that this processor worked for tested examples
• eliminated other mistakes that came from other processor/phase (edge routing)

Hints for final presentation (msp)

DATE OF FINAL PRESENTATION: 2013-07-31, 9:45h

ROOM: 1115

• structure: overview, what were the goals, references, basics
• explain structuring of algorithm into phases and intermediate processors
• presentation created with LateX/OpenOffice - very graphical presentation (less text)
• DEMO of algorithm