David Rappaport
David Rappaport
Dirección de correo verificada de cs.queensu.ca
TítuloCitado porAño
El compás flamenco: a phylogenetic analysis
M Dıaz-Banez, G Farigu, F Gómez, D Rappaport, GT Toussaint
Proceedings of BRIDGES: Mathematical Connections in Art, Music and Science …, 2004
702004
Decision trees for geometric models
EM Arkin, H Meijer, JSB Mitchell, D Rappaport, SS Skiena
International Journal of Computational Geometry & Applications 8 (03), 343-363, 1998
701998
Computing simple circuits from a set of line segments is NP-complete
D Rappaport
SIAM Journal on Computing 18 (6), 1128-1139, 1989
601989
The distance geometry of music
ED Demaine, F Gomez-Martin, H Meijer, D Rappaport, P Taslakian, ...
Computational geometry 42 (5), 429-454, 2009
59*2009
Computing the largest empty convex subset of a set of points
D Avis, D Rappaport
Proceedings of the first annual symposium on Computational geometry, 161-167, 1985
531985
Compatible geometric matchings
O Aichholzer, S Bereg, A Dumitrescu, A García, C Huemer, F Hurtado, ...
Computational Geometry 42 (6-7), 617-626, 2009
512009
Algorithms for computing geometric measures of melodic similarity
G Aloupis, T Fevens, S Langerman, T Matsui, A Mesa, Y Nuñez, ...
Computer Music Journal 30 (3), 67-76, 2006
492006
A convex hull algorithm for discs, and applications
D Rappaport
Computational Geometry 1 (3), 171-187, 1992
491992
Moldable and castable polygons
D Rappaport, A Rosenbloom
Computational Geometry 4 (4), 219-233, 1994
44*1994
Mathematical measures of syncopation
F Gómez, A Melvin, D Rappaport, GT Toussaint
BRIDGES: Mathematical Connections in Art, Music and Science, 73-84, 2005
402005
The largest empty annulus problem
JM Díaz-Báñez, F Hurtado, H Meijer, D Rappaport, JA Sellarès
International Journal of Computational Geometry & Applications 13 (04), 317-325, 2003
372003
The aquarium keeper's problem
J Czyzowicz, P Egyed, H Everett, D Rappaport, T Shermer, D Souvaine, ...
Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms …, 1991
361991
Computing simple circuits from a set of line segments
D Rappaport, H Imai, GT Toussaint
Discrete & Computational Geometry 5 (3), 289-304, 1990
34*1990
Not being (super) thin or solid is hard: A study of grid Hamiltonicity
EM Arkin, SP Fekete, K Islam, H Meijer, JSB Mitchell, Y Núñez-Rodríguez, ...
Computational Geometry 42 (6-7), 582-605, 2009
332009
Moving coins
M Abellanas, S Bereg, F Hurtado, AG Olaverri, D Rappaport, J Tejel
Computational Geometry 34 (1), 35-48, 2006
312006
Computing the minimum weight triangulation of a set of linearly ordered points
H Meijer, D Rappaport
Information Processing Letters 42 (1), 35-38, 1992
311992
Minimum polygon transversals of line segments
D Rappaport
International Journal of Computational Geometry & Applications 5 (03), 243-256, 1995
291995
On the complexity of computing orthogonal polygons from a set of points
D Rappaport
MacGill University. School of Computer Science, 1986
221986
The complexity of computing minimum separating polygons
P Eades, D Rappaport
Pattern Recognition Letters 14 (9), 715-718, 1993
211993
Some extremal results on circles containing points
R Hayward, D Rappaport, R Wenger
Discrete & Computational Geometry 4 (3), 253-258, 1989
211989
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20