Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

Carleton University

$34,000.00

Optimization Problems in Computational Geometry

FY 2016-17

Summary
The general theme in this project is the design, analysis, and implementation of optimization algorithms for geometric problems. The research will concentrate on the following topics: Geometric networks: How to construct a good network that connects a given set of sites. Given such a network, how to use geometric information to compute (exact or approximate) shortest paths between any two given sites. Given such a network, how to modify it so that all sites have good connections. Geometric data structures: How to organize geometric data, such that an informative ""summary"" of the subset of the data that is contained in a query region can be computed. Geometric problems in computer-aided design: How to apply techniques from computational geometry to speed-up algorithmic processes in computer-aided manufacturing.
Program
Discovery Grants Program - Individual
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
250383-2012
Name nom
Smid, Michiel
Department département
Computer Science, School of
Organization id
23
Institution établissement
Carleton University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2016
Competition year année de concours
2012
Award amount
34000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2713
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Algorithms
Research subject fr
Algorithmes
Partie
5
Nb partie
5
Application title
Optimization Problems in Computational Geometry
Keyword
NSERC
Application summary
The general theme in this project is the design, analysis, and implementation of optimization algorithms for geometric problems. The research will concentrate on the following topics: Geometric networks: How to construct a good network that connects a given set of sites. Given such a network, how to use geometric information to compute (exact or approximate) shortest paths between any two given sites. Given such a network, how to modify it so that all sites have good connections. Geometric data structures: How to organize geometric data, such that an informative ""summary"" of the subset of the data that is contained in a query region can be computed. Geometric problems in computer-aided design: How to apply techniques from computational geometry to speed-up algorithmic processes in computer-aided manufacturing.