Distinguished Lecture

On Map Construction, Map Comparison, and Trajectory Clustering
Geo-referenced trajectory data is collected in a wide range of applications, such as for a variety of location-based services on street maps, hiking trail logging, and the study of social behavior in animals. This talk will cover different algorithms for aggregating trajectory data, in particular by constructing road maps. Road map construction is a type of geometric reconstruction problem in which the task is to extract the underlying geometric graph structure described by a set of movement-constrained trajectories, or in other words reconstruct a geometric domain that has been sampled with continuous curves that are subject to noise. Finally, different approaches for map comparison will be discussed, including signatures and distance measures.

Paul Erdős Memorial Lecture

Geometric problems and structures arising from the study of wireless networks
The study of wireless networks has motivated the formulation of interesting geometric optimization problems such as the power assignment problem, as well as the definition of new geometric data structures such as the bounded-angle spanning tree (related to networks with angular constraints) and the SINR diagram (induced by the Signal to Interference plus Noise Ratio equation). This talk will discuss some of these problems and structures, mentioning a few open problems along the way.

Ferran Hurtado Memorial Lecture

On Nonogram and Graph Planarity Puzzle Generation
There are many puzzles in the world, both physical and digital ones. From the algorithms research perspective, a lot of attention has been given to combinatorial and graph-based puzzles and how to solve them. We will focus on puzzles with a geometric component and where techniques from discrete and computational geometry can be employed to generate them. Automated generation of puzzles is arguably more useful than automated solving. We will focus on new nonogram puzzles and new graph planarization puzzles, and encounter digitization of polygons, Hausdorff and Frechet distance, Bezier curves, simulated annealing, graph drawing, and order types.

Click here for the list of accepted papers

Click here for the full proceedings as one file

SCHEDULE

(Room 118 and the Robert B. Schultz Lecture Theatre are located in St. John's College. The Galleria is at the Robert B. Schultz Lecture Theatre. See the campus map.)