Discrete and Computational Geometry is a field where one studies the interplay between geometric properties of discrete structures and the computational problems related to these discrete structures. The field has applications to all areas that touch geometric computing. Application areas are as diverse as protein-folding, wireless networks, facility location, statistical analysis or robot motion planning to name a few. Abstracting and studying the geometry problems that underlie important applications of computing leads not only to new mathematical results, but also to improvements in these application areas. Therein lies the benefits of studying this interplay.

This workshop is a follow-up to the workshop on this topic supported by Fields held in May 2009. The main focus of the current workshop is in the design and analysis of algorithms and data structures to solve problems on geometric structures.

The goal of the workshop is to bring together top researchers in the field both from Canada and abroad to Carleton in order to foster collaboration as well as expose students to important problems in this growing field. As with the last workshop, we expect that this workshop will help establish and strengthen research ties among researchers from Canada and abroad as well as attract top graduate/post-doctorate students to Canada (and Carleton in particular).

Format:

There will be two lectures per d ay held in the morning of each of the five days. The lectures will be of a survey/tutorial nature offering a state-of-the-art view of important topics in the field and related areas of mathematics with applications to geometric algorithms. An emphasis will be placed on highlighting the main techniques in a given area as well as outlining some of the important open problems in the area. The afternoons will be dedicated to discussions on these open problems.

Top