Thesis Topic Details

Topic ID:
3355
Title:
Super Mario Galaxy problem
Supervisor:
Kai Engelhardt
Research Area:
Theory, Algorithms, Geometry
Associated Staff
Assessor:
Aleksandar Ignjatovic
Topic Details
Status:
Active
Type:
Research
Programs:
CS CE BIOM BINF SE
Group Suitable:
No
Industrial:
No
Pre-requisites:
COMP4141, good grasp of algorithms
Description:
Suppose Mario is walking on the surface of a planet. If he starts walking from a known location, in a fixed direction, for a predetermined distance, how quickly can we determine where he will stop?

Crucial detail: the planet is a convex polytope in 3D and all values are proper reals, so we're investigating the problem in a hypothetical universe of machines that work with proper reals.

Comments:
Blatantly lifted from
cstheory. See that page for more details and a pretty picture.
See wikipedia for (sparse) pointers to machine models with proper real numbers.
Past Student Reports
 
No Reports Available. Contact the supervisor for more information.

Check out all available reports in the CSE Thesis Report Library.

NOTE: only current CSE students can login to view and select reports to download.