Algorithms for Drawing Non-Planar Graphs in Three Dimensions

Summary

The project aims to design and implement new graph drawing algorithms for non-planar graphs in three dimensions, under a number of new design constraints.

Supervisor(s)

Professor Seok-Hee Hong

Research Location

Information Technologies

Program Type

Masters/PHD

Synopsis

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. This project aims to relax this constraint, by drawing non-planar graphs in three dimensions.

This research will address new fundamental questions on three dimensional graph drawing, and initiate new research area in geometric representations of graphs in three dimensions.

Want to find out more?

Contact us to find out what’s involved in applying for a PhD.

Contact Research Expert to find out more about participating in this opportunity.

Browse for other opportunities within the Information Technologies .

Keywords

algorithm, graph theory, graph drawing, network visualization

Opportunity ID

The opportunity ID for this research opportunity is: 1031

Other opportunities with Professor Seok-Hee Hong