Recent Publications

My papers that were published in this century are on this page.
Click here for papers I published in the 20th century.

S. Stolpner, D. Rappaport
Note on digitizing precious objects with markings by optical triangulation
Poster session, Graphics Interface 2012 Toronto, May 28 - 30, 2012

V. Dujmovic, W. Evans, S. Lazard, W. Lenhart, G. Liotta, D. Rappaport, and S. Wismath
On point-sets that support planar graphs
Accepted for publication in Computational Geometry:Theory and Applications, March 15, 2012
Abstract in 19th International Symposium on Graph Drawing Graph, Eindhoven Netherlands, pp. 48-56 Sept. 21-23 2011.

M. Mohamad, D. Rappaport and Godfried Toussaint
Minimum many-to-many matchings for computing the distance between two sequences
23rd Canadian Conference on Computational Geometry Toronto, pp. 49-54 August 2011.

Greg Aloupis, Mirela Damian, Robin Flatland Matias Korman Ozgur Ozkan, David Rappaport and Stefanie Wuhrer
Establishing strong connectivity using optimal radius half-disk antennas
23rd Canadian Conference on Computational Geometry Toronto, pp. 361-366 August 2011.

H. Meijer, Y. Núñez Rodríguez, and D. Rappaport
Fault recovery in wireless networks: The geometric recolouring approach
9th International Symposium on Experimental Algorithms, Ischia Island, Italy, May 20-22, 2010.

Boris Aronov, Delia Garijo, Yurai Núñez, David Rappaport, Carlos Seara, Jorge Urrutia
Measuring the error of linear separators on linearly inseparable data
Accepted for publication in Discrete Applied Mathematics, March 3, 2012 PDF
Abstract in Measuring the error of linear separators on linearly inseparable data, XIII Spanish Meeting on Computational Geometry Zaragoza, June 29 - July 1, (2009)

Farzad Hassanzadeh and David Rappaport
Approximation algorithms for finding a minimum perimeter polygon intersecting a set of line segments
WADS 2009 Banff, Alberta, August 21-23 (2009)

Susan Gerofsky, Francisco Gómez, David Rappaport, Godfried Toussaint
Spirograph patterns and circular representations of rhythm: Exploring number theory concepts through visual, tangible and audible representations
BRIDGES 2009 Banff, Alberta, July 26-29 (2009)

B. Aronov, D. Garijo, Y. Núñez, D. Rappaport. C. Seara and J. Urrutia.
Measuring the error of linear separators on linearly inseparable data
XIII Spanish Meeting on Computational Geometry Zaragoza, June 29 - July 1, (2009)

Henk Meijer, Y. Núñez, David Rappaport
An algorithm for computing simple k-factors
Information Processing Letters 109:12, pages 620-625, (2009)
PDF

Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane Souvaine, Jorge Urrutia and David R. Wood
Compatible geometric matchings
Computational Geometry: Theory and Applications 31:20 pages 201-208 (2009)
Also in Topological and Geometric Graph Theory, May 19-23 Paris France, 2008
PDF

Henk Meijer, Yurai Henk Meijer, Yurai Núñez and David Rappaport
Bounds for point recolouring in geometric graphs
Computational Geometry: Theory and Applications 42:6-7, pages 690-703 (2009)
PDF

Erik D. Demaine, Francisco Gómez, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, and David Wood
The distance geometry of music
Computational Geometry: Theory and Applications 42:5 pages 429-454 (2009)
PDF

Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, and Carlos Seara
Small Weak Epsilon Nets
Computational Geometry: Theory and Applications 42:5 pages 455-462 (2009)
also in 17th Canadian Conference on Computational Geometry, Windsor, Ontario, August 10-12 2005 pp. 51--54
Link to CCCG 2005

E. Arkin, S.P. Fekete, K. Islam, H. Meijer,J.S.B. Mitchell, Y. Núñez, V. Polishchuk, D. Rappaport, H. Xiao
Not being (super)thin or solid is hard: A study of grid Hamiltonicity
Computational Geometry: Theory and Applications 42:6-7 pages 582-605 (2009)
PDF

Henk Meijer, Yurai Núñez and David Rappaport
On the complexity of point recolouring in geometric graphs
Proceedings of the 20th Canadian Conference on Computational Geometry, 2008 pp. 143-146.
Link to CCCG 2008

Francisco Gómez, Imad Khoury, Jörg Kienzle, Erin McLeish, Godfried Toussaint, Andrew Melvin, Rolando Pérez-Fernández and David Rappaport
Mathematical models for binarization and ternarization of musical rhythms
Bridges Donostia Mathematics, Music, Art, Architecture, Culture July 24-27, San Sebastian, Spain, 2007
PDF

Md. Kamrul Islam, Henk Meijer, Yurai Núñez, David Rappaport and Henry Xiao
Hamilton circuits in hexagonal grid graphs
Proceedings of the 19th Canadian Conference on Computational Geometry, 2007 pp. 85-89
Link to CCCG 2007

David Rappaport
Maximal Area Sets and Harmony
Akiyama-Chvatal Festschrift, Graphs and Combinatorics, Vol. 23 supplement 1, 2007, pp. 321-329
PDF

Michael Hirsch, Henk Meijer and David Rappaport
Biclique Edge Cover Graphs and Confluent Drawings
14th International Symposium on Graph Drawing, September 18 - 20, 2006,Karlsruhe, Germany, pp. 405-416

David Rappaport
Musical Scales, Integer Partitions, Necklaces, and Polygons
9th ANNUAL INTERNATIONAL CONFERENCE OF BRIDGES: Mathematical Connections in Art, Music, and Science London, England, Aug. 4 - August 9, 2006 pp. 595-598
PDF

Yurai Núñez and David Rappaport
Tight Bounds for Point Recolouring
Proc. 18th Canad. Conf. Comput. Geom., Kingston, ON, Aug. 14-16, 2006. pp. 67 -- 70
Link to CCCG 2006

Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Núñez, David Rappaport, and Godfried Toussaint
Computing a geometric measure of the similarity of two melodies
Computer Music Journal 30:3,2006 pp. 67--76.
also in In Proc. 15th Canad. Conf. Comput. Geom., pages 81-84, 2003.
Link to CCCG 2003

Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Alfredo Garcia Olaverri, David Rappaport, Javier Tejel
Moving Coins
Computational Geometry: Theory and Applications 34:2006, pp. 35-48. .
Link to www.sciencedirect.com
also in Proc. Japanese Conference on Discrete and Computational Geometry, Tokyo Oct. 2004.
PDF

Kathryn Duffy, Chris McAloney, Henk Meijer, and David Rappaport
Closest Segments
17th Canadian Conference on Computational Geometry, Windsor, Ontario, August 10-12 2005 pp. 229--231
Link to CCCG 2005

Erik D. Demaine, Francisco Gómez, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, and David Wood
The Distance Geometry of Deep Rhythms and Scales
17th Canadian Conference on Computational Geometry, Windsor, Ontario, August 10-12 2005 pp. 160--163
Link to CCCG 2005

Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, and Carlos Seara
Small Weak Epsilon Nets
17th Canadian Conference on Computational Geometry, Windsor, Ontario, August 10-12 2005 pp. 51--54
Link to CCCG 2005

Francisco Gómez, Andrew Melvin, David Rappaport, and Godfried Toussaint
Mathematical Measures of Syncopation
8th ANNUAL INTERNATIONAL CONFERENCE OF BRIDGES: Mathematical Connections in Art, Music, and Science Banff, Alberta July 31 - August 3 2005 pp. 73--84
PDF

David Rappaport
Geometry and Harmony
8th ANNUAL INTERNATIONAL CONFERENCE OF BRIDGES: Mathematical Connections in Art, Music, and Science Banff, Alberta July 31 - August 3 2005 pp. 67--72
PDF

Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth
Encompassing Colored Crossing-Free Geometric Graphs
16th Canadian Conference on Computational Geometry, Montréal, Aug. 2004
Link to CCCG 2004

Henk Meijer and David Rappaport
Simultaneous Edge Flips for Convex Subdivisions
16th Canadian Conference on Computational Geometry, Montréal, Aug. 2004
Link to CCCG 2004

J. Miguel Díaz-Báñez , Giovanna Farigu, Francisco Gómez, David Rappaport, Godfried T. Toussaint
El Compás Flamenco: A Phylogenetic Analysis
7th ANNUAL INTERNATIONAL CONFERENCE OF BRIDGES: Mathematical Connections in Art, Music, and Science SOUTHWESTERN COLLEGE WINFIELD, KANSAS July 30 - August 1 2004
PDF

D. Rappaport.
The visibility graph of congruent discs is Hamiltonian
Computational Geometry: Theory and Applications, 25:257-265, 2003.
PDF

D. Rappaport.
Tight bounds for visibility matching of f-equal width objects
In J. Akiyama and M. Kano, editors, Proceedings of JCDCG 2002, volume 2866 of Lecture Notes Comput. Sci., pages 246-250. Springer-Verlag, 2003.
PDF

J. M. Díaz-Báñez, F. Hurtado, H. Meijer, D. Rappaport, and T. Sellares.
The largest empty annulus problem
Int. J. Computational Geometry & Applications, 13(4):317-325, 2003.
also in Lecture Notes in Computer Science, 2331:46-54, 2002.
PDF

P. Bose, F. Hurtado, H. Meijer, S. Ramaswami, D. Rappaport, V. Sacristán, T. Shermer, and G. Toussaint.
Finding specified sections of arrangements: 2d results
Journal of Mathematical Modelling and Algorithms, 1:3-16, 2002.
also in Proc. 10th Canadian Conference in Computational Geometry, 1998.
Link to JMMA

K. Hosono, H. Meijer, and D. Rappaport.
On the visibility graph of convex translates
Discrete Applied Mathematics, 113:195-210, 2001.
PS

Thomas Fevens, Henk Meijer, and David Rappaport.
Minimum convex partition of a constrained point set
Discrete Applied Mathematics, 109:95-107, 2001.
also in In Abstracts 14th European Workshop Comput. Geom., pages 79-81. Universitat Polytènica de Catalunya, Barcelona, 1998.
PS

Jean-Marie Bourjolly, Thomas Fevens, Antonio Hernandez, Antonio Mesa, David Rappaport, Michael Soss, and Godfried Toussaint
Finding non-degenerate points in space
In COMPUMAT 2000 Manzanillo Cuba, 2000.

Click here for papers I published in the 20th century.