Drawing Algorithms for Almost Planar Graphs
The project aims to develop graph drawing algorithms under a number of constraints related to planarity.
Graph drawing algorithms aim to produce human-readable pictures of relational data. These algorithms are used in visualization software underlying many data mining tools, in domains such as market surveillance, fraud detection, bioinformatics, software re-engineering, and counter-terrorism. Planar graph drawing algorithms have a long history both in the theoretical mathematical literature and the pragmatic visualization literature; however, the planarity constraint is very restrictive for practical applications, and this project aims to relax this constraint.
Want to find out more?
The opportunity ID for this research opportunity is: 1012
Other opportunities with Professor Peter Eades
- Visual Analytics
- Geometric Algorithms
- Algorithmics for social networks
- Embeddings of graphs on arrangements of planes in three dimensions
- Embedding graphs in non-Euclidean geometries
Other opportunities with Professor Seok-Hee Hong