Grant: Discovery Grants Program - Individual
University of Calgary
$15,000.00
Interval analysis, computer graphics algorithms and social networks
EF 2014-15
Résumé
Interval analysis uses real compact intervals for algorithm development as opposed to real numbers. This enables the inclusion of both computational and experimental error in the computations and to develop algorithms that deliver guaranteed result within intervals. In this area it is proposed to continue the work on devising efficient methods for the range of functions using interval analysis techniques. The result of this investigation will be applied to the interval Newton method, the interval generalization of Newton's method in numerical analysis for the solution of non-linear equations. It is also proposed to investigate the degree elevation and reduction of interval Bezier curves and surfaces. These curves and surfaces are interval generalizations of the commonly used Bezier curves and surfaces in computer graphics. They based on the interval Bernstein polynomials first investigated by the PI. When Bernstein polynomials are degree elevated and reduced the error committed in the computations means that the polynomial degree is no longer correct. In computer graphics, it is proposed to continue the work on rendering efficiency in particular on GPU's. A sophisticated indexing scheme will be considered that avoid superfluous computations. In computational geometry, the work on efficient intersections for 3D solids will be continued. This work is of importance for several areas which involve geometric computations such as for example computer graphics, GIS and solid modeling, This work used techniques from interval analysis combined with exact computation tools. Applied problems in social networks will be considered as they pertain to local industry needs. In particular the work with a local company on a scheme for charitable donations has been successful. Support for this project was provided by MITACS and will be applied for from MITACS for the next phase. A local company that is a world class leader in crowdsourcing is developing an expanded system for which they need expert advise and implementation assistance. An application by the PI and a colleague for MITACS support is currently being considered.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Alberta, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
8081-2013
Name nom
Rokne, Jon
Department département
Computer Science
Organization id
11
Institution établissement
University of Calgary
Province en
Alberta
Province fr
Alberta
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2014
Competition year année de concours
2013
Award amount
15000
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
1202
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Physical sciences
Area of application fr
Sciences physiques
Research subject code
2707
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Graphics
Research subject fr
Infographie
Partie
2
Nb partie
5
Application title
Interval analysis, computer graphics algorithms and social networks
Keyword
NSERC
Application summary
Interval analysis uses real compact intervals for algorithm development as opposed to real numbers. This enables the inclusion of both computational and experimental error in the computations and to develop algorithms that deliver guaranteed result within intervals. In this area it is proposed to continue the work on devising efficient methods for the range of functions using interval analysis techniques. The result of this investigation will be applied to the interval Newton method, the interval generalization of Newton's method in numerical analysis for the solution of non-linear equations. It is also proposed to investigate the degree elevation and reduction of interval Bezier curves and surfaces. These curves and surfaces are interval generalizations of the commonly used Bezier curves and surfaces in computer graphics. They based on the interval Bernstein polynomials first investigated by the PI. When Bernstein polynomials are degree elevated and reduced the error committed in the computations means that the polynomial degree is no longer correct. In computer graphics, it is proposed to continue the work on rendering efficiency in particular on GPU's. A sophisticated indexing scheme will be considered that avoid superfluous computations. In computational geometry, the work on efficient intersections for 3D solids will be continued. This work is of importance for several areas which involve geometric computations such as for example computer graphics, GIS and solid modeling, This work used techniques from interval analysis combined with exact computation tools. Applied problems in social networks will be considered as they pertain to local industry needs. In particular the work with a local company on a scheme for charitable donations has been successful. Support for this project was provided by MITACS and will be applied for from MITACS for the next phase. A local company that is a world class leader in crowdsourcing is developing an expanded system for which they need expert advise and implementation assistance. An application by the PI and a colleague for MITACS support is currently being considered.