Shortest Path algorithms for the traversal of an Order-5 square tiling from within a confined space

Shortest Path algorithms for the traversal of an Order-5 square tiling from within a confined space

Snellenberg, Ravi (TU Delft Electrical Engineering, Mathematics and Computer Science)

Skrodzki, M. (mentor)
Bidarra, Rafael (mentor)
Smaragdakis, G. (graduation committee)

Delft University of Technology

Delft University of Technology

Computer Science and Engineering

CSE3000 Research Project

2023-06-30

It is possible to use a different representation of space in a Virtual Reality (VR) game, instead of using the euclidean representation we are used to. The reason why that is interesting is that it opens up the possibility of traversing infinitely far in the virtual space while being confined to a relatively limited space in the real world. But for this to be a useful use case, people will need the ability to traverse this new space in an intuitive or at least competent way. One way to help people with navigation in such a space would be to show the person what the fastest path from point A to point B is. This paper researches the possible ways to calculate this path so it can be used to help people while they are traversing this different type of space. Concluding that a trade-off needs to be made between the speed and accuracy of the result depending on the situation, and that no algorithm exists which is the best in both speed and accuracy. Meaning that the context determines what algorithm should be used.

Hyperbolic space
Shortest path
Virtual reality
Navigation

http://resolver.tudelft.nl/uuid:b27fd9bd-8f8a-49b4-b1f8-5e6774a0f304

Student theses

bachelor thesis

© 2023 Ravi Snellenberg