Computer Science: Fully Funded EPSRC DTP PHD Scholarship: Visualisation of Temporal Networks Through Interactions with the Space-Time Cube
Dynamic data sets where each element of the data has its own individual timestamp has become more prevalent. Algorithms for drawing temporal networks within the space-time cube (2D + t) have been devised to allow dynamic graphs to be visualised in an event-based way. However, three-dimensional representations of non-spatial information are difficult to navigate. Therefore, interactive systems are necessary to fully understand the graph structure and how it evolves over time.
The student will investigate perceptually effective ways for dividing and visualising the space-time cube. The project will start by visualising the contents of this space-time cube with an embedded network drawn with an event-based dynamic graph drawing algorithm. The visualisation methods in this case will focus on visualising the already present structure within the drawing which takes into account both spatial position and time simultaneously. Then, we will explore methods that are able to draw the dynamic graph on demand in the space time cube steered by the user.
Candidates must normally hold an undergraduate degree at 2.1 level in Computer Science, Mathematics or a closely related discipline, or an appropriate master’s degree with a minimum overall grade at ‘Merit’ (or Non-UK equivalent as defined by Swansea University).
Duolingo English Test
Certify your English proficiency with the Duolingo English Test! The DET is a convenient, fast, and affordable online English test accepted by over 4,000 universities around the world.
make use of the comment box if you have any question or Contribution Regarded these post