Computational geometric aspects of rhythm, melody, and voice-leading
From MaRDI portal
Publication:733549
DOI10.1016/j.comgeo.2007.01.003zbMath1175.65034OpenAlexW2116417064MaRDI QIDQ733549
Publication date: 16 October 2009
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2007.01.003
algorithmsconvolutioncomputational geometrysequence comparisonnecklacescomputational music theoryevenness measuresmelodymusic information retrievalmusical rhythmrhythm similarityvoice-leading
Related Items
Scaling and compressing melodies using geometric similarity measures ⋮ Scalar context in musical models ⋮ Asymmetric polygons with maximum area ⋮ Mathematics and flamenco: an unexpected partnership ⋮ Derivative-free mixed binary necklace optimization for cyclic-symmetry optimal design problems ⋮ Computing melodic templates in oral music traditions ⋮ Characterization of extremal antipodal polygons
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Variations on the theme of repeated distances
- On a cyclic string-to-string correction problem
- On the sum of distances along a circle
- An algorithm for computing the restriction s|caffold assignment problem in computational biology
- On some metric and combinatorial geometric problems
- A distance problem of P. Erdős with some further restrictions
- An improved algorithm for solving the banded cyclic string-to-string correction problem
- On some problems of elementary and combinatorial geometry
- Two special cases of the assignment problem
- Some properties of Matusita's measure of affinity of several distributions
- A partial digest approach to restriction site mapping
- Fast algorithms for the maximum convolution problem
- A comparison of \(p\)-dispersion heuristics
- On measuring the distance between histograms,
- Approximation algorithms for maximum dispersion
- On extremal point disributions in the Euclidean plane
- On the sum of squared distances in the Euclidean plane
- On the comparison of the Spearman and Kendall metrics between linear orders.
- Fun-Sort -- or the chaos of unordered binary search
- Approximate string matching for music analysis
- Periodic musical sequences and Lyndon words
- The discrete p-maxian location problem
- Sorting by means of swappings
- Maximum dispersion and geometric maximum weight cliques
- Convex polygons with few intervertex distances
- Distance measures for point sets and their computation
- Efficient many-to-Many point matching in one dimension
- The content, consequence and likeness approaches to verisimilitude: compatibility, trivialization, and underdetermination
- A point set puzzle revisited
- The maximal dispersion problem and the ``first point outside the neighbourhood heuristic
- The Mathematics of Musical Instruments
- The Geometry of Musical Chords
- Generalized Voice-Leading Spaces
- Prelude to Musical Geometry
- The Hexachordal Theorem: A Mathematical Look at Interval Relations in Twelve-Tone Composition
- Research Problems in Discrete Geometry
- Structural properties of Euclidean rhythms
- On the sum of distances determined by a pointset
- Über eine Punktverteilung auf der Kugel
- Homometrism in close-packed structures
- David Lewin and maximally even sets
- On Patterson's cyclotomic sets and how to count them
- 313. Generalisations of π: some applications
- Sharper lower bounds for discrimination information in terms of variation (Corresp.)
- On the Maximum of the Sum of Squared Distances Under a Diameter Constraint
- Finding rotational symmetries by cyclic string matching
- Algorithms on Strings, Trees and Sequences
- Heuristic and Special Case Algorithms for Dispersion Problems
- The Structure of Homometric Sets
- There Are No New Homometric Golomb Ruler Pairs with 12 Marks or Less
- NECKLACE SWAP PROBLEM FOR RHYTHMIC SIMILARITY MEASURES
- An Efficient Algorithm for Generating Necklaces with Fixed Density
- GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
- Necklaces, Convolutions, and X + Y
- The Geometry of Musical Rhythm
- On A Problem of P. Erdos
- On a Simple Minkowski Metric Classifier
- Some Theorems on Convex Polygons
- On the Different Distances Determined by n Points
- On Sets of Distances of n Points
- A note on the sum of distances under a diameter constraint
