Godfried Toussaint

Godfried Toussaint

Godfried T. Toussaint is a computer scientist, a professor in the School of Computer Science at McGill University Montreal, Canada since 1972. He is an expert in various aspects of computational geometry and its applications: pattern recognition, motion planning and others. Other interests include instance-based learning, music information retrieval, and computational music theory. [ [http://www.cs.mcgill.ca/people/faculty/profile?uid=godfried G. Toussaint profile] at the McGill University]

He has been editor and associate editor of a number of scientific journals.

He is an author and namesake of the efficient "Akl-Toussaint algorithm" for the construction of the convex hull of a planar point set.

Mathematical research in music

In February 2005 he became a researcher in the Centre for Interdisciplinary Research in Music Media and Technology in the Schulich School of Music at McGill University. His application of mathematical methods for tracing the roots of Flamenco [J. Miguel Diaz-Banez, Giovanna Farigu, Francisco Gomez, David Rappaport, Godfried T. Toussaint, " [http://cgm.cs.mcgill.ca/~godfried/publications/winfield.pdf El Compas Flamenco: A Phylogenetic Analysis] ", Proc. BRIDGES: Mathematical Connections in Art, Musicand Science, Southwestern College, Winfield, Kansas, July 30 - August 1, 2004, pp. 61-70.] were covered in numerous publications in several languages. [ [http://www.mcgill.ca/reporter/38/10/flamenco/ "Flamenco Forensics"] , "McGill Reporter, January 26, 2006.]

Awards

In 1978 he was the recipient of the Pattern Recognition Society's "Best Paper of the Year Award".In 1985 he was awarded a two-year Killam Senior Research Fellowship by the Canada Council.In 1996 he was awarded the Canadian Image Processing and Pattern Recognition Society's "Service Award" for his "outstanding contribution to research and education in Computational Geometry." In May 2001 he was awarded the David Thomson Award for excellence in graduate supervision and teaching at McGill University. [ [http://www-cgrl.cs.mcgill.ca/~godfried/ G. Toussaint home page] ]

Books and book chapters

* G. T. Toussaint, Editor, Computational Geometry, North-Holland Publishing Company, Amsterdam, 1985.
* G. T. Toussaint, Editor, Computational Morphology, North-Holland Publishing Company, Amsterdam, 1988.
*J. O'Rourke and G. T. Toussaint, "Pattern recognition," Chapter 51 in the Handbook of Discrete and Computational Geometry, Eds., J. E. Goodman and J. O'Rourke, Chapman & Hall/CRC, New York, 2004, pp. 1135-1162.
*J. O'Rourke and G. T. Toussaint, "Pattern recognition," Chapter 43 in the Handbook of Discrete and Computational Geometry, Eds., J. E. Goodman and J. O'Rourke, CRC Press, New York, 1997, pp. 797-813.

References


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Toussaint — (French: All Saints ) may mean:* Toussaint, Seine Maritime, a commune in the arrondissement of Le Havre in the Seine Maritime département of Francethe name of:* François Vincent Toussaint (1715 1772), author of Les Mœurs ( The Manners ) published …   Wikipedia

  • Art gallery problem — The art gallery problem or museum problem is a well studied visibility problem in computational geometry. It originates from a real world problem of guarding an art gallery with the minimum number of guards which together can observe the whole… …   Wikipedia

  • Nœud trivial — Le nœud trivial Deux diagrammes simples du nœud trivial …   Wikipédia en Français

  • Convex hull algorithms — Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science, see Convex hull applications . In computational geometry, numerous algorithms are proposed for computing the convex… …   Wikipedia

  • Minimum bounding box algorithms — In computational geometry, the smallest enclosing box problem is that of finding the oriented minimum bounding box enclosing a set of points. It is a type of bounding volume. Smallest may refer to volume, area, perimeter, etc. of the box. It is… …   Wikipedia

  • Relative neighborhood graph — In computational geometry, the relative neighborhood graph (RNG) was proposed by Godfried Toussaint in 1980. [G. T. Toussaint, “The relative neighborhood graph of a finite planar set,” Pattern Recognition, vol. 12, pp. 261 268, 1980.] There has… …   Wikipedia

  • Rotating calipers — is a computational algorithm developed by Michael Shamos in 1978 for determining all antipodal pairs of points and vertices on a convex polygon or convex hull. The term rotating calipers was later coined in 1983 by the computer scientist Godfried …   Wikipedia

  • Grafo de vecindad relativa — En geometría computacional, el Grafo de vecindad relativa (Relative Neighborhood Graph, RNG por sus siglas en inglés) es el subgrafo que extrae las aristas entre los vértices más próximos (respecto a una métrica dada) de un grafo genérico. Fue… …   Wikipedia Español

  • Hamiltonian path — This article is about the overall graph theory concept of a Hamiltonian path. For the specific problem of determining whether a Hamiltonian path or cycle exists in a given graph, see Hamiltonian path problem. A Hamiltonian cycle in a dodecahedron …   Wikipedia

  • McGill University School of Computer Science — The School of Computer Science is a School in the Faculty of Science at McGill University located in the McConnell Engineering Building at 3480 University, Montreal. The school is the second most funded computer science department in Canada[1].… …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”