Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of Waterloo

$51,000.00

New directions in computational geometry

FY 2012-13

Summary
Since its inception over thirty years ago, computational geometry has been a thriving field of research in algorithm design and analysis, with numerous applications in areas ranging from geographic information systems and computer graphics, to computer-aided manufacturing, statistics, and robotics. In this proposal, I will identify several exciting developments in the field that allow us to rethink the standard and most fundamental problems in new ways. (1) Recently, it has been shown that many basic geometric problems (e.g., computing intersections of line segments) can surprisingly be solved faster than researchers have previously thought possible. The improved algorithms exploit word-level parallelism to speed up computation and work under the ""word RAM"" model, which in many ways is more realistic than the traditional ""real RAM"" model. (2) Traditional algorithm analysis concentrates primarily on worst-case input, which may not arise often in practice. It has recently been discovered that several basic geometric problems (e.g., computing two- and three-dimensional convex hulls) admit ""instance-optimal"" algorithms that not only work faster on easier input, but has provably the best possible asymptotic running time on every input point set! (3) Emerging applications involving massive data sets have led to a reexamination of geometric problems in models such as ""streaming"", which turn the focus towards space usage. I plan to find new techniques and new algorithms under all these different settings. In addition, one general theme is how connections between techniques in computational geometry and other branches of algorithm design can benefit from each other.
Program
Discovery Grants Program - Individual
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
228113-2010
Name nom
Chan, Timothy
Department département
Computer Science, David R. Cheriton School of
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2012
Competition year année de concours
2010
Award amount
51000
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
3
Nb partie
5
Application title
New directions in computational geometry
Keyword
NSERC
Application summary
Since its inception over thirty years ago, computational geometry has been a thriving field of research in algorithm design and analysis, with numerous applications in areas ranging from geographic information systems and computer graphics, to computer-aided manufacturing, statistics, and robotics. In this proposal, I will identify several exciting developments in the field that allow us to rethink the standard and most fundamental problems in new ways. (1) Recently, it has been shown that many basic geometric problems (e.g., computing intersections of line segments) can surprisingly be solved faster than researchers have previously thought possible. The improved algorithms exploit word-level parallelism to speed up computation and work under the ""word RAM"" model, which in many ways is more realistic than the traditional ""real RAM"" model. (2) Traditional algorithm analysis concentrates primarily on worst-case input, which may not arise often in practice. It has recently been discovered that several basic geometric problems (e.g., computing two- and three-dimensional convex hulls) admit ""instance-optimal"" algorithms that not only work faster on easier input, but has provably the best possible asymptotic running time on every input point set! (3) Emerging applications involving massive data sets have led to a reexamination of geometric problems in models such as ""streaming"", which turn the focus towards space usage. I plan to find new techniques and new algorithms under all these different settings. In addition, one general theme is how connections between techniques in computational geometry and other branches of algorithm design can benefit from each other.
University of Waterloo - $51,000 Grant (2012-13) | Canada Spends