Browsing Mathematics (Faculty of) by Subject "shortest paths"
Now showing items 1-3 of 3
-
Reconfiguring Triangulations
(University of Waterloo, 2015-01-06)The results in this thesis lie at the confluence of triangulations and reconfiguration. We make the observation that certain solved and unsolved problems about triangulations can be cast as reconfiguration problems. We ... -
Shortest Paths in Geometric Intersection Graphs
(University of Waterloo, 2018-06-29)This thesis studies shortest paths in geometric intersection graphs, which can model, among others, ad-hoc communication and transportation networks. First, we consider two classical problems in the field of algorithms, ... -
The Star Unfolding from a Geodesic Curve
(University of Waterloo, 2014-11-06)An unfolding of a polyhedron P is obtained by `cutting' the surface of P in such a way that it can be flattened into the plane into a single polygon. For most practical and theoretic applications, it is desirable for an ...