Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

Simon Fraser University

$30,000.00

Complexity of geometric arrangements

EF 2007-08

Résumé
Arrangement of simple geometric shapes (lines, triangles, hyperplanes) can lead to very complex arrangements. The complexity of many geometric algorithms crucially depend on the complexity of the these arrangements, therefore it is important to understand what requirements ensure a bound on the complexity of the arrangements and therefore on the running time of certain algorithms. In certain computational or combinatorial problems that are seemingly not geometric in nature, for example in some optimization problems, one can represent the data in as an arrangement of surfaces or other shapes and apply geometric arguments in the solution. The proposed research is a continuation on similar research carried out by myself and other researchers on complexity of geometric arrangements. We propose for example to extend results about the complexity of the union of fat objects from two to higher dimensions. Geometric graphs proved to be very useful in modeling spatial arrangements and relations. We propose to work on the extremal theory of geometric graphs and related theory of ordered graphs.
Programme
Discovery Grants Program - Individual
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
329257-2006
Name nom
Tardos, Gabor
Department département
Computing Science
Organization id
5
Institution établissement
Simon Fraser University
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2007
Competition year année de concours
2006
Award amount
30000
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
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
Research subject code
2703
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Complexity
Research subject fr
Complexité
Partie
2
Nb partie
3
Application title
Complexity of geometric arrangements
Keyword
NA
Application summary
Arrangement of simple geometric shapes (lines, triangles, hyperplanes) can lead to very complex arrangements. The complexity of many geometric algorithms crucially depend on the complexity of the these arrangements, therefore it is important to understand what requirements ensure a bound on the complexity of the arrangements and therefore on the running time of certain algorithms. In certain computational or combinatorial problems that are seemingly not geometric in nature, for example in some optimization problems, one can represent the data in as an arrangement of surfaces or other shapes and apply geometric arguments in the solution. The proposed research is a continuation on similar research carried out by myself and other researchers on complexity of geometric arrangements. We propose for example to extend results about the complexity of the union of fat objects from two to higher dimensions. Geometric graphs proved to be very useful in modeling spatial arrangements and relations. We propose to work on the extremal theory of geometric graphs and related theory of ordered graphs.