Godfried Toussaint

Along with Selim Akl, he was an author and namesake of the efficient "Akl–Toussaint algorithm" for the construction of the convex hull of a planar point set.

[3] In 1980 he introduced the relative neighborhood graph (RNG) to the fields of pattern recognition and machine learning, and showed that it contained the minimum spanning tree, and was a subgraph of the Delaunay triangulation.

His dissertation, Feature Evaluation Criteria and Contextual Decoding Algorithms in Statistical Pattern Recognition, was supervised by Robert W.

He applied computational geometric and discrete mathematics methods to the analysis of symbolically represented music in general, and rhythm in particular.

In 2004 he discovered that the Euclidean algorithm for computing the greatest common divisor of two numbers implicitly generates almost all the most important traditional rhythms of the world.

In 1996 he won the Canadian Image Processing and Pattern Recognition Society's Service Award for his "outstanding contribution to research and education in Computational Geometry."