Euclidean rhythm: Difference between revisions

Jump to navigation Jump to search
Content added Content deleted
m (44 revisions imported)
No edit summary
Line 1: Line 1:
The '''Euclidean rhythm''' in music was discovered by [[Godfried Toussaint]] in 2004 and is described in a 2005 paper "The [[Euclidean algorithm|Euclidean Algorithm]] Generates Traditional Musical Rhythms".<ref name="gtpdf">[http://cgm.cs.mcgill.ca/~godfried/publications/banff.pdf The Euclidean algorithm generates traditional musical rhythms] by G. T. Toussaint, ''Proceedings of BRIDGES: Mathematical Connections in Art, Music, and Science'', Banff, Alberta, Canada, July 31 to August 3, 2005, pp. 47–56.</ref> The [[greatest common divisor]] of two numbers is used [[Rhythm|rhythmically]] giving the number of [[beat (music)|beats]] and silences, generating almost all of the most important [[World Music]] rhythms,<ref name="gtweb">[http://cgm.cs.mcgill.ca/~godfried/rhythm-and-mathematics.html Comparative Musicology – Musical Rhythm and Mathematics]</ref> (except [[India#Performing arts|Indian]]).<ref name="extv">The Euclidean Algorithm Generates Traditional Musical Rhythms, by Godfried Toussaint, [http://cgm.cs.mcgill.ca/~godfried/publications/banff-extended.pdf Extended version] of the paper that appeared in the ''Proceedings of BRIDGES: Mathematical Connections in Art, Music and Science’’, Banff, Alberta, Canada, July 31–August 3, 2005, pp. 47–56.</ref> The beats in the resulting rhythms are as equidistant as possible; the same results can be obtained from the [[Bresenham's line algorithm|Bresenham]] algorithm.
The '''Euclidean rhythm''' in music was discovered by Godfried Toussaint in 2004 and is described in a 2005 paper "The Euclidean Algorithm Generates Traditional Musical Rhythms".<ref name="gtpdf">[http://cgm.cs.mcgill.ca/~godfried/publications/banff.pdf The Euclidean algorithm generates traditional musical rhythms] by G. T. Toussaint, ''Proceedings of BRIDGES: Mathematical Connections in Art, Music, and Science'', Banff, Alberta, Canada, July 31 to August 3, 2005, pp. 47–56.</ref> The greatest common divisor of two numbers is used [[Rhythm|rhythmically]] giving the number of beats and silences, generating almost all of the most important World Music rhythms,<ref name="gtweb">[http://cgm.cs.mcgill.ca/~godfried/rhythm-and-mathematics.html Comparative Musicology – Musical Rhythm and Mathematics]</ref> (except Indian).<ref name="extv">The Euclidean Algorithm Generates Traditional Musical Rhythms, by Godfried Toussaint, [http://cgm.cs.mcgill.ca/~godfried/publications/banff-extended.pdf Extended version] of the paper that appeared in the ''Proceedings of BRIDGES: Mathematical Connections in Art, Music and Science’’, Banff, Alberta, Canada, July 31–August 3, 2005, pp. 47–56.</ref> The beats in the resulting rhythms are as equidistant as possible; the same results can be obtained from the [https://en.wikipedia.org/wiki/Bresenham%27s_line_algorithm Bresenham's line algorithm].


== Open-source hardware projects ==
== Open-source hardware projects ==
[[Open source projects]] that can generate Euclidean rhythms, include [[Mutable Instruments]] [[Mutable Instruments MIDIPal|MIDIPal]] and [[Mutable Instruments Grids|Grids]], [[RebelTech Stoicheia|RebelTech's Stoicheia]] and [[Ruin & Wesen Minicommand|Ruin & Wesen's Minicommand]].

[[Open-source hardware|Open-source music hardware]] projects that can generate Euclidean rhythms, include Mutable Instruments [http://mutable-instruments.net/midipal/build MIDIPal] and [http://mutable-instruments.net/modules/grids/manual Grids], RebelTech's Stoicheia and Ruin & Wesen's [http://ruinwesen.com/products Minicommand]

== Other uses of Euclid's algorithm in music ==

In the 17th century [[Conrad Henfling]] writing to [[Gottfried Wilhelm Leibniz|Leibniz]] about music theory and the tuning of [[musical instruments]] makes use of the [[Euclidean algorithm]] in his reasoning.<ref name="plusmaths">[http://plus.maths.org/content/os/issue40/features/wardhaugh/index Musical pitch and Euclid's algorithm]</ref>


== See also ==
== See also ==
Line 25: Line 20:
* [http://plus.maths.org/issue40/features/wardhaugh/index.html Music and Euclid's algorithm]
* [http://plus.maths.org/issue40/features/wardhaugh/index.html Music and Euclid's algorithm]


[[Category:Euclid]]
[[Category:Music theory]]
[[Category:Music theory]]
{{iwWikipedia}}{{From Wikipedia}}
[[Category:Musical analysis]]

{{Rhythm and meter}}

{{Music-theory-stub}}

Revision as of 21:49, 2 March 2016

The Euclidean rhythm in music was discovered by Godfried Toussaint in 2004 and is described in a 2005 paper "The Euclidean Algorithm Generates Traditional Musical Rhythms".[1] The greatest common divisor of two numbers is used rhythmically giving the number of beats and silences, generating almost all of the most important World Music rhythms,[2] (except Indian).[3] The beats in the resulting rhythms are as equidistant as possible; the same results can be obtained from the Bresenham's line algorithm.

Open-source hardware projects

Open source projects that can generate Euclidean rhythms, include Mutable Instruments MIDIPal and Grids, RebelTech's Stoicheia and Ruin & Wesen's Minicommand.

See also

References

  1. ^ The Euclidean algorithm generates traditional musical rhythms by G. T. Toussaint, Proceedings of BRIDGES: Mathematical Connections in Art, Music, and Science, Banff, Alberta, Canada, July 31 to August 3, 2005, pp. 47–56.
  2. ^ Comparative Musicology – Musical Rhythm and Mathematics
  3. ^ The Euclidean Algorithm Generates Traditional Musical Rhythms, by Godfried Toussaint, Extended version of the paper that appeared in the Proceedings of BRIDGES: Mathematical Connections in Art, Music and Science’’, Banff, Alberta, Canada, July 31–August 3, 2005, pp. 47–56.

External links

Template:IwWikipediaThis page uses Creative Commons Licensed content from Wikipedia:Euclidean_rhythm (view authors).