From Art Galleries to Terrain Modelling --- A Meandering Path through Computational Geometry
We give approximation and online algorithms as well as data structures for some well studied problems in computational geometry. The thesis is divided into three parts. In part one, we study problems related to guarding, exploring and searching geometric environments. We show inapproximability results for guarding lines and 2-link polygons, question stated time bounds for computing shortes
