Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

Carleton University

$37,000.00

Optimization problems in computational geometry

FY 2007-08

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 three topics:Geometric networks and shortest path problems: 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.Geometric problems in computer-aided manufacturing: How can techniques from computational geometry be used to improve the time needed to manufacture three-dimensional objects from their CAD-representations.Geometric data structures: How to organize geometric data, such that a "summary'' of the subset of the data that is contained in any query region can be computed.
Program
Discovery Grants Program - Individual
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
250383-2007
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
2007
Competition year année de concours
2007
Award amount
37000
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
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
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
1
Nb partie
5
Application title
Optimization problems in computational geometry
Keyword
NA
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 three topics:Geometric networks and shortest path problems: 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.Geometric problems in computer-aided manufacturing: How can techniques from computational geometry be used to improve the time needed to manufacture three-dimensional objects from their CAD-representations.Geometric data structures: How to organize geometric data, such that a "summary'' of the subset of the data that is contained in any query region can be computed.
Carleton University - $37,000 Grant (2007-08) | Canada Spends