G
Godfried G. Toussaint
Researcher at McGill University
Publications - 18
Citations - 373
Godfried G. Toussaint is an academic researcher from McGill University. The author has contributed to research in topics: Euclidean geometry & Decision boundary. The author has an hindex of 7, co-authored 18 publications receiving 337 citations.
Papers
More filters
Journal ArticleDOI
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries
David Bremner,Erik D. Demaine,Jeff Erickson,John Iacono,Stefan Langerman,Pat Morin,Godfried G. Toussaint +6 more
TL;DR: Output-sensitive algorithms for computing this decision boundary for point sets on the line and in ℝ2 are developed, which is the best possible when parameterizing with respect to n and k.
Book ChapterDOI
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries
David Bremner,Erik D. Demaine,Jeff Erickson,John Iacono,Stefan Langerman,Pat Morin,Godfried G. Toussaint +6 more
TL;DR: Output-sensitive algorithms for computing this decision boundary for point sets on the line and in ℝ2 are developed, which is the best possible when parameterizing with respect to n and k.
Journal ArticleDOI
Lower bounds for computing statistical depth
TL;DR: In this paper, it was shown that computing the Simplicial depth of a query point with respect to a set of points S is computationally solvable in O(n log n) time, which matches the upper bound of the algorithms of Rousseeuw and Ruts.
Journal ArticleDOI
The distance geometry of music
Erik D. Demaine,Francisco Gomez-Martin,Henk Meijer,David Rappaport,Perouz Taslakian,Godfried G. Toussaint,Terry Winograd,David R. Wood +7 more
TL;DR: Euclidean rhythms have the mathematical property that their onset patterns are distributed as evenly as possible: they maximize the sum of the Euclidean distances between all pairs of onsets, viewing onsets as points on a circle.
Journal ArticleDOI
Structural properties of Euclidean rhythms
TL;DR: It is shown that a Euclidean rhythm is formed of a pattern, called the main pattern, repeated a certain number of times, followed possibly by one extra pattern, the tail pattern, and it is proved that the decomposition obtained is minimal.