June 21, 2018

Workshop on Discrete and Computational Geometry
August 13-17, 2012

to be held at the

Organizing Committee:
Prosenjit Bose, Vida Dujmovi, Anil Maheshwari, Pat Morin, Michiel Smid
(Carleton University)

Workshop Home page


The focus of the workshop is on the design and analysis of algorithms for geometric facility location problems: Given an environment consisting of geometric objects (such as points, disks, or polygons), how to compute the optimal placement of one or more “facilities” such that all objects are close to some facility or far away from all facilities. These type of problems have been studied extensively in Computational Geometry, but there are still many open problems. Moreover, applications in emerging fields such as Wireless Networks (where to place the facilities and how to connect them by a network such that they can collaborately monitor the entire environment?) lead to problems that have not been considered before.
The workshop will bring together top researchers in the field of Computational Geometry from Canada and abroad to Carleton University. Moreover, graduate students will be exposed to new and important problems in this growing field. The workshop will help continue and strengthen the strong ties among researchers from Canada and abroad, as well as attract top graduate/post-doctorate students to Canada (and Carleton University in particular).


There will be ten invited speakers, each giving a one-hour lecture in the form of a survey/ tutorial, presenting a state-of-the-art overview of the most relevant results and open problems in the field of facility location problems. These lectures will be given in the mornings of each of the five days. The afternoons will be dedicated to discussions on the open problems presented in the morning lectures. Thus, graduate students and established researchers will actively work together in trying to solve these open problems.