Computational Geometry in Manitoba.
Our research group
works on projects in theoretical computer science
and, in particular, on algorithmic problems that involve geometry.
These projects span a number of areas within the field of
theoretical computer science, including
algorithms, data structures, computational complexity, graph theory,
and operational research.
We are interested in theoretical results motivated by applications
in mobile ad hoc wireless networks and sensor networks,
distributed routing algorithms, facility location and operations research,
statistics, and spatial data structures.
Specific topics of interest include mobile facility location,
kinetic data structures, geometric models for wireless communication,
geometric range searching, negative results in local routing,
and space-efficient array range query data structures.
members
of the Computational Geometry Laboratory in April 2011