1. Research Topics of Potential Interest to Geography COMPUTER SCIENCE Research Away Day, 29 th April 2010 Thomas Erlebach

2. Department of Computer Science Main research topics Algorithms on graphs and networks Algorithms on geometric objects –Automatic map labelling –Geometric coverage problems Computing with uncertainty –Algorithms for efficient data gathering

3. Department of Computer Science Graphs and Networks Analyse properties of networks. Design algorithms to compute / count substructures in networks. Optimisation problems.

4. Department of Computer Science Geometric problems: Map Labelling

5. Department of Computer Science Leicester Point Feature, Sliding Label (horizontally sliding) (fully sliding)

6. Department of Computer Science Map Labelling with Sliding Labels Given: A set of weighted point features with rectangular, sliding labels Task: Label points of maximum total weight with non-overlapping labels

7. Department of Computer Science Approximation Result There is a polynomial-time approximation scheme for weighted map labelling with rectangular sliding labels of bounded height or length ratio.

8. Department of Computer Science Geometric Coverage Problems Example problem: Given a set of points and a set of geometric objects, determine a smallest set of objects that covers all points. Approximation algorithms for various shapes (squares, disks).

9. Department of Computer Science Computing with Uncertainty In many application settings, only estimates of data values are easily available. Exact data can be obtained by an update (query) at a certain cost. We study methods that minimise the update costs needed to compute the desired result.