Primary supervisor
Helen PurchaseNetwork visualisation (or 'graph drawing') algorithms allow us to see connections and patterns in a network clearly. There are a large number of such algorithms that depict ('lay out') networks 'nicely' - according to a set of well-established criteria. These criteria apply to neat diagrams - with clear straight (nor neatly bent or curved) lines ('edges').
This project will investigate how networks that have been sketched (with curved/ wavy lines) can be adapted so that they, too, can be assessed by typical graph layout criteria.
Aim/outline
At the core: to develop a system that will take as input a sketched graph drawing and to output 'quality' measurements for the drawing.
Enhancements: a sketch interface for drawing the networks; a 'neaten' algorithm to tidy them up; an experiment to assess the validity of the criteria metrics
Required knowledge
Good interface programming