Refereed Journal Publications

"Reading maketh a full man, conference a ready man, and writing an exact man."

Francis Bacon

2011

  1. "Bounded-degree polyhedronization of point sets," Computational Geometry: Theory and Applications, Special Issue of best papers selected from CCCG-2011, accepted November 3, 2011. (with G. Barequet, N. Benbernou, D. Charlton, E. Demaine, M. Demaine, M. Ishaque, A. Lubiw, A. Schulz, D. Souvaine, and A. Winslow)
  2. "The edit distance as a measure of perceived rhythmic similarity," Empirical Musicology Review Vol. 6, No. 3, 2011, in press. (with O. Post)
  3. "The rhythm that conquered the world: What makes a "good" rhythm good," Percussive Notes, November Issue, 2011, pp. 52-59.
  4. "Computational models of symbolic rhythm similarity: Correlation with human judgments," Analytical Approaches to World Music, Vol. 1, No. 2, 2011. (with M. Campbell and N. Brown)
  5. "The marble frieze patterns of the Cathedral of Siena: Geometric structure, multi-stable perception, and types of repetition," Journal of Mathematics and the Arts, Vol. 5, Issue 3, 2011, pp. 115-127. (with Y. Liu)
  6. "Computing signed permutations of polygons," International Journal of Computational Geometry and Applications, Vol. 21, No. 1, 2011, pp. 87-100. (with G. Aloupis, P. Bose, E. D. Demaine, S. Langerman, H. Meijer, and M. Overmars)

2010

  1. "Categories of repetition in the geometric meander art of  Greek and Roman mosaics," Hyperseeing, Spring 2010, pp. 25-38. (with Yang Liu)
  2. "Unraveling Roman mosaic meander patterns: a simple algorithm for their generation," Journal of Mathematics and the Arts, Vol. 4, No. 1, March 2010, pp. 1-11. (with Yang Liu)
  3. "Computational geometric aspects of rhythm, melody and voice-leading," Computational Geometry: Theory and Applications, Vol. 43, Issue 1,  January 2010, pp. 2-22. Available online 21 March 2009. http://dx.doi.org/10.1016/j.comgeo.2007.01.003

2009

  1. "Measuring similarity between flamenco rhythmic patterns," Journal of New Music Research, Vol. 38, No. 2, 2009, pp. 129–138. (with C. Guastavino, F. Gómez, F. Marandola, and E. Gómez)
  2. "A new method for classifying fret and meander patterns," Hyperseeing, Summer 2009, pp. 43-50. (with Yang Liu)

2008


  1. "Classification and phylogenetic analysis of African rhythm timelines," Musicae Scientiae, (accepted for publication April 1, 2005).
  2. "A tessellation-transformation method for categorizing and generating geometric textile design patterns," Design Principles and Practices, Vol. 2, No. 4, 2008, pp. 101-112. (with Yang Liu)
  3. "On polyhedra induced by point sets in space," Discrete Applied Mathematics, Vol. 156, 2008, pp. 42-54. (with Pankaj Agarwal, Ferran Hurtado, and Joan Trias)
  4. "Edge-unfolding nested polyhedral bands," Computational Geometry: Theory and Applications, Vol. 39, 2008, pp. 30-42. (with Greg Aloupis, Erik Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke,  and Ileana Streinu)

2007

  1. "Efficient many-to-many point matching in one dimension," Graphs and Combinatorics", Vol. 23, June 2007, supplement, Computational Geometry and Graph Theory, The Akiyama-Chvatal Festschrift, pp. 169-178. (with Justin Colannino, Mirela Damian, Ferran Hurtado, Stefan Langerman, Henk Meijer, Suneeta Ramaswami, and Diane Souvaine)

    2. 2006

  1. "A comparison of rhythmic dissimilarity measures," FORMA, Vol. 21, No. 2, 2006, pp. 129-149.
  2. "Algorithms for computing geometric measures of melodic similarity," Computer Music Journal, Vol. 30, No. 3, Fall 2006, pp. 67-76. (with Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Nunez, and David Rappaport)
  3. "An O(n log n)-time algorithm for the restriction scaffold assignment problem," Journal of Computational Biology", Vol. 13, No. 4, May 2006, pp. 979-989. (with Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, and Suneeta Ramaswami)

2005

  1. "The Erdos-Nagy theorem and its ramifications," Computational Geometry: Theory and Applications, Vol. 31, No. 3, 2005, pp. 219-236. (Special Issue containing Selected Papers from the Eleventh Canadian Conference on Computational Geometry).
  2. "An algorithm for computing the restriction scaffold assignment problem in computational biology," Information Processing Letters, Volume 95, Issue 4, August 2005, pp. 466-471. (with Justin Colannino)
  3.  "Similaridad y evolucion en la ritmica del flamenco: una uncursion de la matematica computacional," La Gaceta de la Real Sociedad Matematica Espanola, Vol. 8, No. 2, 2005, pp. 498-509. (with Jose-Miguel Diaz-Banez, Giovana Farigu, Francisco Gomez, and David Rappaport)
  4. "Geometric proximity graphs for improving nearest neighbor methods in instance-based learning and data mining," International Journal of Computational Geometry and Applications, Vol. 15, No. 2, April 2005, pp. 101-150.
  5.  "Output-sensitive algorithms for computing nearest-neighbor decision boundaries," Discrete and Computational Geometry, Vol. 33, No. 4, 2005, pp. 593-604. (with David Bremner, Erik Demaine, Jeff Erickson, John Iacono, Stefan Langerman, and Pat Morin)

    6. 2004

  6. "More classes of stuck unknotted hexagons," Contributions to Algebra and Geometry, Vol. 45, No. 2, 2004, pp. 429-434. (with Greg Aloupis, and Gunter Ewald)
  7.  "Constructing convex 3-polytopes from two triangulations of a polygon," Computational Geometry: Theory and Applications, Vol. 28, No. 1, May 2004, pp. 41-47. (Special Issue containing the six best papers selected from the 14th Canadian Conference on Computational Geometry, Lethbridge, Alberta, August 2002). (with Benjamin Marlin)
  8.  "Space-efficient planar convex hull algorithms," Theoretical Computer Science, Vol. 321/1, March 2004, pp. 25-40. (with Herve Bronnimann, John Iacono, Jirky Katajainen, Pat Morin, and Jason Morrison)

2003

  1. "Algorithms for bivariate medians and a Fermat-Toricelli problem for lines," Computational Geometry: Theory and Applications, Special Issue containing the Selected Papers from the Thirteenth Canadian Conference on Computational Geometry - CCCG'01, Vol. 26, No. 1, August 2003, pp. 60-79. (with Greg Aloupis, Stefan Langerman, and Michael Soss)
  2.  "On the role of kinesthetic thinking in computational geometry," Journal of Mathematical Education in Science and Technology, Vol. 34, No. 2, 2003, pp. 219-237. (with J. Antonio Sellares)
  3. "Simple proofs of a geometric property of four-bar linkages," American Mathematical Monthly, Vol. 110, No. 6, June-July 2003, pp. 482-494.

    2002

  1. " Experimental results on quadrangulations of sets of fixed points," Computer Aided Geometric Design, Vol. 19, 2002, pp. 533-552. (with Prosenjit Bose, Suneeta Ramaswami, and Alain Turki)
  2. "Aperture angle optimization problems in 3 dimensions," Journal of Mathematical Modelling and Algorithms, Vol. 1, 2002, pp. 301-329. (with Elsa Omana-Pulido)
  3. "Flipturning polygons," Discrete and Computational Geometry, Vol. 28, 2002, pp. 231-253. (with Oswin Aichholzer, Carmen Cortes, Erik Demaine, Vida Dujmovic, Jeff Erickson, Henk Meijer, Mark Overmars, Belen Palop, and Suneeta Ramaswami)
  4. "Lower bounds for computing statistical depth," Computational Statistics and Data Analysis, Vol. 40, 2002, pp. 223-229.  (with Greg Aloupis, Carmen Cortes, Francisco Gomez, Michael Soss) Also Tech. Report # SOCS-01.1, School of Computer Science, McGill University, February 22, 2001. Can also be found on The Mathematics Preprint Server: http://www.mathpreprints.com/math/Preprint/Aloupis_G/20020107/1
  5. "Implicit convex polygons," Journal of Mathematical Modelling and Algorithms, Vol. 1, 2002, pp. 57-85. (with Francisco Gomez, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristan)
  6. "Finding specified sections of arrangements: 2D results," Journal of Mathematical Modelling and Algorithms, Vol. 1, 2002, pp. 3-16. (with Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristan, Thomas Shermer)
  7. "Some aperture-angle optimization problems," Algorithmica, Vol. 33, 2002, pp. 411-435. (with Prosenjit Bose, Ferran Hurtado, Elsa Omana-Pulido, Jack Snoeyink)
  8. "A note on reconfiguring tree linkages: trees can lock," Discrete Applied Mathematics, Vol. 117, 2002, pp. 293-297. (and Therese Biedl, Eric Demaine, Martin Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, and Sue Whitesides)
    2001


  1. "On computing general position views of data in three dimensions," Journal of Visual Communication and Image Representation, Vol. 12, No. 4, 2001, pp. 387-400. (with Francisco Gomez and Suneeta Ramaswami)
  2. "Nice perspective projections," Journal of Visual Communication and Image Representation, Vol. 12, 2001, pp. 387-400. (with Francisco Gomez, Ferran Hurtado and J. Antonio Sellares)
  3. "On degeneracies removable by perspective projections," International Journal of Mathematical Algorithms, Vol. 2, 2001, pp. 227-248. (with Francisco Gomez, Ferran Hurtado, and Antoni Sellares)
  4. "Reconfiguring convex polygons," Computational Geometry: Theory and Applications, Vol. 20, Numbers 1-2, October 2001, pp. 85-95. (with Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark Overmars, and Michael Soss)
  5. "Convexifying polygons with simple projections," Information Processing Letters, Vol. 80, No. 2, 2001, pp. 81-86. Also Technical Report SOCS-00.4, July 2000. (with Jorge Alberto Calvo, Danny Krizanc, Pat Morin, and Michael Soss)
  6. "Every set of disjoint line segments admits a binary tree," Discrete and Computational Geometry, Vol. 26, No. 3, August 2001, pp. 387-410. (with Prosenjit Bose and Michael E. Houle)
  7. "Locked and unlocked polygonal chains in three dimensions," Discrete and Computational Geometry, Vol. 26, No. 3, August 2001, pp. 269-281. (with Therese Biedl, Eric Demaine, Marty Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark Overmars, Steve Robbins, Ileana Streinu, and Sue Whitesides)
  8. "A new class of stuck unknots in Pol-6," Contributions to Algebra and Geometry, Vol. 42, No. 2, 2001, pp. 301-306.
  9. "Simple polygons with an infinite sequence of deflations," Contributions to Algebra and Geometry, Vol. 42, No. 2, 2001, pp. 307-311. (with Thomas Fevens, Antonio Hernandez, Antonio Mesa, Patrick Morin, and Michael Soss)

2000

  1. "Geometric and computational aspects of polymer reconfiguration," Journal of Mathematical Chemistry, Vol. 27, No. 4, 2000, pp. 303-318. (with Michael Soss)
  2. "Some constrained minimax and maximim location problems," Studies in Locational Analysis, Special Issue on Computational Geometry in Locational Analysis, Guest Editor: Juan Mesa, Issue No. 15, December 2000, pp. 17-35. (with Ferran Hurtado and Vera Sacristan)
  3. "Computing the constrained Euclidean, geodesic and link centers of a simple polygon with applications," Studies in Locational Analysis, Special Issue on Computational Geometry in Locational Analysis, Guest Editor: Juan Mesa, Issue No. 15, December 2000, pp. 37-66. (with Prosenjit Bose)

1999

  1. "Drawing nice projections of objects in space," Journal of Visual Communication and Image Representation, Vol. 10, No. 2, June 1999, pp. 157-172. (with Prosenjit Bose, Francisco Gomez and Pedro Ramos)
  2. "Computing a shortest weakly externally visible line segment for a simple polygon," International Journal of Computational Geometry and Applications, Vol. 9, No. 1, February 1999, pp. 81-96. (with Binay K. Bhattacharya and Asish Mukhopadhyay)

1998

  1. "Filling polyhedral molds," Computer Aided Design, Vol. 30, No. 4, 1998, pp. 245-254. (with Prosenjit Bose and Marc van Kreveld)
  2. "Converting triangulations to quadrangulations," Computational Geometry: Theory and Applications, Vol. 9, March 1998, pp. 257-276. (with Suneeta Ramaswami and Pedro Ramos)
1997
  1. "Characterizing and efficiently computing quadrangulations of planar point sets," Computer-Aided Geometric Design , vol. 14, 1997, pp. 763-785. (with Prosenjit Bose)
  2. "Feasibility of design in stereolithography," Algorithmica, Special Issue on Computational Geometry in Manufacturing, vol. 19, No. 1/2, Sept/Oct, 1997, pp. 61-83. (with B. Asberg, G. Blanco, P. Bose, J. Garcia-Lopez, M. Overmars, G. Wilfong and B. Zhu)
  3. "Guarding polyhedral terrains," Computational Geometry: Theory and Applications, vol.7, No. 3, February 1997, pp. 173-186. (with P. Bose, T. Shermer and B. Zhu)

1996

  1. "All convex polyhedra can be clamped with parallel jaw grippers," Computational Geometry: Theory and Application, (invited paper selected from the best at CCCG'94) vol. 6, 1996, pp. 291-302. (with Prosenjit Bose and David Bremner)
  2. "On envelopes of arrangements of lines," Journal of Algorithms, vol. 21, 1996, pp. 111-148. (with David Eu and Eric Guevremont)

1995

  1. "Geometric and computational aspects of gravity casting," Computer-Aided Design , vol. 27, No. 6, 1995, pp. 455-464. (with Prosenjit Bose)
  2. "Growing a tree from its branches," Journal of Algorithms, vol. 19, 1995, pp. 86-103. (with Prosenjit Bose)

1994

  1. "Finding Hamiltonian circuits in arrangements of Jordan curves is NP-complete," Information Processing Letters, vol. 52, 1994, pp. 183-189. (with Chuzo Iwamoto)
  2. "A counter-example to a fast algorithm for finding the convex hull of a simple polygon," Computer Aided Drafting, Design and Manufacturing, vol. 4, No. 2, December 1994, pp. 1-4.
  3. "Geometric and computational aspects of manufacturing processes," Computers & Graphics, vol. 18, No. 4, 1994, pp. 487-497. (with Prosenjit Bose)
  4. "On approximating polygonal curves in two and three dimensions," CVGIP: Graphical Models and Image Processing, vol. 56, No. 3, May 1994, pp. 231-246. (with David Eu)
  5. "Linear approximation of simple objects," Computational Geometry: Theory and Applications, vol. 4, 1994, pp. 27-52. (with Jean-Marc Robert)
  6. "A counter-example to Tomek's consistency theorem for a condensed nearest neighbor decision rule," Pattern Recognition Letters, vol. 15, August 1994, pp. 797-801.

1993

  1. "Slicing an ear using prune-and-search," Pattern Recognition Letters, vol. 14, No. 9, September 1993, pp. 719-722. (with H. ElGindy and H. Everett)
  2. "Editorial," Pattern Recognition Letters, vol. 14, No. 9, September 1993, pp. 697-702.
  3. "Convex hulls for random lines," Journal of Algorithms, vol. 14, 1993, pp. 381-394. (with Luc Devroye)
  4. "A new look at Euclid's second proposition," The Mathematical Intelligencer, vol. 15, No. 3, 1993, pp. 12-23.
  5. "Un nuevo vistazo a la segunda proposicion de Euclides," Mathesis, vol. 9, 1993, pp. 265-294.

1992

  1. "Computing shortest transversals of sets," International Journal of Computational Geometry and Applications, vol. 2, No. 4, December 1992, pp. 417-436. (with B. Bhattacharya, J. Czyzowicz, P. Egyed, I. Stojmenovic, and J. Urrutia)
  2. "Computational geometry," Proceedings of the IEEE, vol. 80, No. 9, September 1992, pp. 1347-1363.
  3. "Relative neighborhood graphs and their relatives," Proceedings of the IEEE, vol. 80, No. 9, September 1992, pp. 1502-1517. (with J. W. Jaromczyk)

1991

  1. "Efficient triangulation of simple polygons," The Visual Computer, vol. 7, No. 5-5, September 1991, pp. 280-295.
  2. "Computing shortest transversals," Computing, vol. 46, 1991, pp. 93-119. (with B. K. Bhattacharya)
  3. "A counter example to a dynamic algorithm for convex hulls of line arrangements," Pattern Recognition Letters, vol. 12, March 1991, pp. 145-147. (with B. K. Bhattacharya, and H. Everett)
  4. "A counter-example to a convex hull algorithm for polygons," Pattern Recognition, vol.24, No. 2, 1991, pp. 183-184.
  5. "Anthropomorphic polygons," American Mathematical Monthly, January 1991, pp. 31-35.

1990

  1. "The Graham scan triangulates simple polygons," Pattern Recognition Letters, vol. 11, November 1990, pp. 713-716. (with X. Kong and H. Everett)
  2. "Computing the external geodesic diameter of a simple polygon," Computing, vol. 44, 1990, pp. 1-19. (with D. Samuel)
  3. "Computing simple circuits from a set of line segments," Discrete & Computational Geometry, vol. 5, 1990, pp. 289-304. (with D. Rappaport and H. Imai)

1989

  1. "Computing geodesic properties inside a simple polygon," invited paper in special issue on geometric reasoning, Revue D'Intelligence Artificielle, Vol. 3, No. 2, 1989, pp. 9-42.
  2. "On separating two simple polygons by a single translation," Discrete & Computational Geometry, vol. 4, no. 3, 1989, pp. 265-278.
  3. "On geodesic properties of polygons relevant to linear-time triangulation," The Visual Computer, vol. 5, no. 1/2, March 1989, pp. 68-74. (with H. ElGindy)

1988

  1. "Computing the link center of a simple polygon," Discrete & Computational Geometry, vol. 3, 1988, pp. 281-293. (with W. Lenhart, R. Pollack, J. Sack, R. Seidel, M. Sharir, S. Suri, S. Whitesides and C. Yap)
  2. "Computing the width of a set," IEEE Trans. Pattern Analysis & Machine Intelligence, vol. 10, no. 5, September 1988, pp. 761-765. (with M. E. Houle)
  3. "Fast algorithms for computing the diameter of a finite planar set," The Visual Computer, Vol. 3, No. 6, May 1988, pp.379-388. (with B. K. Bhattacharya)
  4. "Computational geometry," editorial, The Visual Computer, Vol. 3, No. 6, May 1988, pp.321-322.

1987

  1. "Comments on Bayes' classification rule for the general discrete case," Pattern Recognition, Vol. 20, No. 4, 1987, p. 411.

1986

  1. "Visibility between two edges of a simple polygon," The Visual Computer, vol. 2, 1986, pp. 342-357. (with David Avis, Teren Gum)
  1. "A linear-time algorithm for solving the strong-hidden line problem in a simple polygon," Pattern Recognition Letters, vol. 4, December 1986, pp. 449-451.

1985

  1. "On the ultimate convex hull algorithm in practice," Pattern Recognition Letters, vol. 3, January 1985, pp. 29-34. (with Mary M. McQueen)
  2. "A historical note on convex hull finding algorithms," Pattern Recognition Letters, vol. 3, January 1985, pp. 21-28.
  3. "A simple linear hidden-line algorithm for star-shaped polygons," Pattern Recognition Letters, vol. 3, January 1985, pp. 35-39. (with David Rappaport)
  4. "Finding the minimum vertex distance between two disjoint convex polygons in linear time," Computers and Mathematics with Applications, vol. 11, No. 12, 1985, pp. 1227-1242. (with Michael McKenna)
  5. "A simple linear algorithm for intersecting convex polygons, The Visual Computer, vol. 1, 1985, pp. 118-123.

1984

  1. "Separation of two monotone polygons in linear time," Robotica, vol. 2, 1984, pp.215-220. (with Hossam A. ElGindy)
  2. "Complexity, convexity, and unimodality," International Journal of Computer and Information Sciences, vol. 13, No. 3, June 1984, pp. 197-217.
  3. "An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons," Computing, vol. 32, 1984, pp. 357-364.
  4. "A new linear algorithm for triangulating monotone polygons," Pattern Recognition Letters, vol. 2, March, 1984, pp. 155-158.

1983

  1. "On the application of the convex hull to histogram analysis in threshold selection," Pattern Recognition Letters, vol. 2, December, 1983, pp. 75-77.
  2. "Optimal algorithms for computing the minimum distance between two finite planar sets," Pattern Recognition Letters, vol. 2, December, 1983, pp. 79-82. (with Binay K. Bhattacharya)
  3. "Computing largest empty circles with location constraints," International Journal of Computer and Information Sciences, vol. 12, No. 5, October, 1983, pp. 347-358.
  4. "Time-and -storage-efficient implementation of an optimal planar convex hull algorithm," Image and Vision Computing, vol. 1, No. 3, August, 1983, pp. 140-144. (with Binay K. Bhattacharya)
  5. "The symmetric all-furthest-neighbor problem," Computers and Mathematics with Applications, vol. 19, No. 6, 1983, pp. 747-754.
  6. "Efficient algorithms for computing the maximum distance between two finite planar sets," Journal of Algorithms, vol. 14, 1983, pp. 121-136. (with Binay K. Bhattacharya)
  7. "A counter example to an algorithm for computing monotone hulls of simple polygons," Pattern Recognition Letters, vol. 1, 1983, pp. 219-222. (with Hossam ElGindy)
  8. "Applications of a two-dimensional hidden-line algorithm to other geometric problems," Computing, vol. 31, 1983, pp. 191-202. (with Hossam ElGindy and David Avis)

1982

  1. "An upper bound on the probability of misclassification in terms of Matusita's measure of affinity," Annals of the Institute of Statistical Mathematics, vol. 34, No. 1, Part A, 1982, pp. 161-165. (with Binay K. Bhattacharya)
  2. Godfried T. Toussaint, "A counter example to a diameter algorithm for convex polygons," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. PAMI-4, No. 3, May 1982, pp. 306-309. (with Binay K. Bhattacharya)
  3. "A simple proof of Pach's extremal theorem for convex polygons," Pattern Recognition Letters, vol. 1, 1982, pp. 85--86.
  4. "On the multimodality of distances in convex polygons," Computers and Mathematics with Applications, vol. 8, No. 2, 1982, pp. 153-156. (with David Avis and Binay K. Bhattacharya)
  5. "A simple O(n log n) algorithm for finding the maximum distance between two finite planar sets," Pattern Recognition Letters, vol. 1, 1982, pp. 21-24. (with Jim A. McAlear)
  6. "On a convex hull algorithm for polygons and its application to triangulation problems," Pattern Recognition, vol. 15, No. 1, 1982, pp. 23-29. (with David Avis)

1981

  1. "An efficient algorithm for decomposing a polygon into star-shaped polygons," Pattern Recognition, vol. 13, No. 6, 1981, pp. 395-398.  (with David Avis)
  2. "A note on linear expected time algorithms for finding convex hulls," Computing, vol. 26, 1981, pp. 361-366. (with Luc Devroye)
  3. "An optimal algorithm for determining the visibility of a polygon from an edge," IEEE Transactions Computers, vol. C-30, No. 12, December 1981, pp. 910-914. (with David Avis)
  4. "Comment on algorithms for computing relative neighborhood graph," Electronics Letters, vol. 16, No. 22, October l981, pp. 860-861.
  5. "Evaluation of single-cell classification schemes for computer classification of cervical cells," Analytic & Quantitative Cytology, vol. 3, No. 3, September 1981, pp. 207-215. (with Ron S. Poulsen, Leslie H. Oliver and Claude Louis)

1980

  1. "The relative neighborhood graph of a finite planar set," Pattern Recognition, vol. 12, 1980, pp.261-268
  2. "Comment on divergence and probability of error in pattern recognition," Proceedings of the IEEE, vol. 68, April 1980, pp. 539-540. (with Binay K. Bhattacharya)
  3. "The sensitivity of the modified Viterbi algorithm to the source statistics," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. PAMI-2, March 1980, pp. 181-185. (with Rajjan Shinghal)

1979

  1. "Classification of atypical cells in the automatic cytoscreening for cervical cancer," Pattern Recognition, vol. 11, 1979, pp. 205-212. (with Leslie H. Oliver, Ron S. Poulsen and Claude Louis)
  2. "Probabilities of occurrence of characters, character-pairs, and character-triplets in English text," Bulletin of the Assoc. for Literary and Linguistic Computing, vol. 6, 1978, pp. 245-253. (with Rajjan Shinghal)
  3. "A bottom-up and top-down approach to using context in text recognition," International Journal of Man-Machine Studies, vol. 11, 1979, pp. 201-212. (with Rajjan Shinghal)
  4. "Experiments in text recognition with the modified Viterbi algorithm," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. PAMI-l, April 1979, pp. 184-193. (with Rajjan Shinghal)
  5. "Addendum to an improved algorithm to check for polygon similarity," Information Processing Letters, vol. 8, March 1979, pp. 157-158. (with Selim Akl)

1978

  1. "A fast convex hull algorithm," Information Processing Letters, vol. 7, August 1978, pp. 219-222. (with Selim G. Akl)
  2. "Probability of error, expected divergence, and the affinity of several distributions," IEEE Trans. Systems, Man, and Cybernetics, vol. SMC-8, June 1978, pp. 482-485.
  3. "A simplified heuristic version of a recursive Bayes algorithm for using context in text recognition," IEEE Trans. Systems, Man, and Cybernetics, vol. SMC-8, May 1978, pp.412-414. (with Rajjan Shinghal and David Rosenberg)
  4. "The use of context in pattern recognition," Invited paper, Pattern Recognition, vol. 10, 1978, pp. 189-204. (winner of the Pattern Recognition Society's Best-Paper-of-the-Year Award)
  5. "An improved algorithm to check for polygon similarity," Information Processing Letters, vol. 7, April 1978, pp. 127-128. (with Selim G. Akl)

1977

  1. "An upper bound on the probability of misclassification in terms of the affinity," Proceedings of the IEEE, February 1977, pp. 275-276.
  2. "A generalization of Shannon's equivocation and the Fano bound," IEEE Trans. Systems, Man, and Cybernetics, April 1977, pp. 300-302.
  3. "High resolution analysis of cervical cells - a progress report," Journal of Histochemistry and Cytochemistry, vol. 25, 1977, pp. 689-695. (with Ron S. Poulsen, Leslie H. Oliver, Robert L. Cahn and Claude Louis)
  4. "Segmentation of cervical cell images," Journal of Histochemistry and Cytochemistry, vol. 25, 1977, pp. 681-688. (with Robert L. Cahn and Ron S. Poulsen)
  5. "Estimating false positive and false negative error rates in cervical cell classification," Journal of Histochemistry and Cytochemistry, vol. 25, 1977, pp. 696-701. with Leslie H. Oliver and Ron S. Poulsen)
  6. "On the detection of structures in noisy pictures," Pattern Recognition, vol. 9, pp. 95-98, 1977. (with Mel Cohen)

1975

  1. "Comments on a new class of bounds on Bayes risk in multihypothesis pattern recognition," IEEE Transctions on Computers, vol. C-24, August 1975, p. 855.
  2. "Sharper lower bounds for discrimination information in terms of variation," IEEE Transactions on Information Theory, January 1975, pp. 99-100.
  3. "Subjective clustering and bibliography of books on pattern recognition," Information Sciences, vol. 8, 1975, pp. 251-257.
  4. "An efficient method for estimating the probability of misclassification applied to a problem in medical diagnosis," Computers in Biology and Medicine, vol. 4, 1975, pp. 269-278. (with Patricia M. Sharpe)

1974

  1. "Some applications of generalizations of Pi," The Mathematical Gazette, December 1974, pp. 291-293.
  2. "Some properties of Matusita's measure of affinity of several distributions," Annals of the Institute of Statistical Mathematics, vol. 26, 1974, pp. 389-396.
  3. "Comments on the extraction of pattern features from imperfectly identified samples," IEEE Trans. Computers, vol. C-23, September 1974, pp. 988-989.
  4. "Bibliography on estimation of misclassification," IEEE Trans. Information Theory, vol. IT-20, July 1974, pp. 472-479.

1973

  1. "Comment on the relationship between the equivocation and other probabilistic distance measures used for feature selection," Proc. IEEE, December 1973, p. 1761.

1972

  1. "Comments on a comparison of seven techniques for choosing subsets of pattern recognition properties," IEEE Trans. Computers, vol. C-21, September 1972, pp. 1028-1029.
  2. "Comments on error bounds for a contextual recognition procedure," IEEE Trans. Computers, vol. C-21, September 1972, p. 1027.
  3. "Feature evaluation with quadratic mutual information," Information Processing Letters, vol. 1, June 1972, pp. 153-156.
  4. "Comments on the divergence and Bhattacharyya distance measures in signal selection," IEEE Trans. Communication Technology, vol. COM-20, June 1972, p. 485.
  5. "Comments on theoretical comparison of a class of feature selection criteria in pattern recognition," IEEE Trans. Computers, vol. C-21, June 1972, pp. 615-616.
  6. "Comments on feature selection with a linear dependence measure," IEEE Trans. Computers, vol. C-21, April 1972, pp. 408. (with Toomas R. Vilmansen)
  7. "Some inequalities between distance measures for feature evaluation," IEEE Trans. Computers, vol. C-21, April 1972, pp. 409-410.
  8. "Polynomial representation of classifiers with independent discrete-valued features," IEEE Trans. Computers, vol. C-21, February 1972, pp. 205-208.
  9. "Results obtained using a simple character recognition procedure on Munson's hand printed data," IEEE Trans. Computers, vol. C-21, February 1972, pp. 201-205. (with A. B. Shahidul Hussain, and Robert W. Donaldson)

1971

  1. "Some functional lower bounds on the expected divergence for multhypothesis pattern recognition, communication, and radar systems," IEEE Trans. Systems, Man, and Cybernetics, vol. SMC-l, October 1971, pp. 384-385.
  2. "Historical note on Minkowski metric classifiers," IEEE Trans Systems, Man, and Cybernetics, vol. SMC-l, October 1971, pp. 387-388. (with J. W. Carl)
  3. "Comments on a modified figure of merit for feature selection in pattern recognition," IEEE Trans. Information Theory, vol. IT-17, September 1971, pp. 618-620.
  4. "Note on optimal selection of independent binary-valued features for pattern recognition," IEEE Trans. Information Theory, vol. IT-17, September 1971, p. 618.
  5. "Some upper bounds on error probability for multiclass pattern recognition," IEEE Trans. Computers, vol. C-21, August 1971, pp. 943-944.
  6. "Comments on a dynamic programming approach to the selection of pattern features," IEEE Trans. Systems, Man, and Cybernetics, vol. SMC-l, April 1971, pp. 186-187. (with A. B. Shahidul Hussain)

1970

  1. "Use of contextual constraints in recognition of contour-traced hand printed characters," IEEE Trans. Computers, vol. C-l9, November 1970, pp. 1096-1099. (with Robert  W. Donaldson)
  2. "On a simple Minkowski metric classifier," IEEE Trans. Systems Science and Cybernetics, vol. SSC-6, October 1970, pp. 360-362.
  3. "Algorithms for recognizing contour-traced hand printed characters," IEEE Trans. Computers, vol. C-l9, June 1970, pp. 541-546. (with Robert  W. Donaldson)

1969

  1. "Ultralinear ramp generator uses UJT to drive Darlington," Electronic Design, vol. 17, No. 21, October 1969, pp. 117-119.