Journal Publications
Total number: 155
2006

Greg Aloupis, Erik Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke,
Ileana Streinu, and Godfried Toussaint, "Unfolding
polyhedral bands," Computational Geometry: Theory and Applications,
(selected papers of CCCG 2004), accepted for publication, April
21, 2006.

Greg Aloupis, Erik Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke,
Ileana Streinu and Godfried T. Toussaint, "Edgeunfolding
nested polyhedral bands," Computational Geometry: Theory and
Applications, (accepted in 2004).

Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa,
Yurai Nunez, David Rappaport, and Godfried Toussaint, "Algorithms
for computing geometric measures of melodic similarity," Computer
Music Journal, (accepted for publication October 4, 2005).

Godfried T. Toussaint, "A comparison of rhythmic
similarity measures," FORMA, (accepted for publication April
7, 2005).

Godfried T. Toussaint, "Classification and phylogenetic
analysis of African rhythm timelines," Musicae Scientiae,
(accepted for publication April 1, 2005).

Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer,
Suneeta Ramaswami and Godfried T. Toussaint, "An
O(n log n)time algorithm for the restriction scaffold assignment problem,"
Journal
of Computational Biology", Vol. 13, No. 4, May 2006, pp. 979989.
2005

Godfried T. Toussaint, "The ErdosNagy theorem and
its ramifications," Computational Geometry: Theory and Applications,
Vol. 31, No. 3, 2005, pp. 219236. (Special Issue containing Selected Papers
from the Eleventh Canadian Conference on Computational Geometry).

Justin Colannino and Godfried Toussaint, "An algorithm
for computing the restriction scaffold assignment problem in computational
biology," Information Processing Letters, Volume 95, Issue
4, August 2005, pp. 466471.

JoseMiguel DiazBanez, Giovana Farigu, Francisco Gomez, David Rappaport
and Godfried T. Toussaint, "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. 498509.

Godfried T. Toussaint, "Geometric proximity graphs
for improving nearest neighbor methods in instancebased learning and data
mining," International Journal of Computational Geometry and
Applications, Vol. 15, No. 2, April 2005, pp. 101150.

Miguel DiazBanez, Francisco Gomez and Godfried T. Toussaint, "Computing
shortest paths for transportation of hazardous materials in continuous
spaces," Journal of Food Engineering, Vol. 30, 2005, pp.
293298.

David Bremner, Erik Demaine, Jeff Erickson, John Iacono, Stefan Langerman,
Pat Morin and Godfried Toussaint, "Outputsensitive
algorithms for computing nearestneighbor decision boundaries,"
Discrete
and Computational Geometry, Vol. 33, No. 4, 2005, pp. 593604.
2004

Greg Aloupis, Gunter Ewald, and Godfried T. Toussaint, "More
classes of stuck unknotted hexagons," Contributions to
Algebra and Geometry, Vol. 45, No. 2, 2004, pp. 429434.

Benjamin Marlin and Godfried T. Toussaint, "Constructing
convex 3polytopes from two triangulations of a polygon," Computational
Geometry: Theory and Applications, Vol. 28, No. 1, May 2004, pp. 4147.
(Special Issue containing the six best papers selected from the 14th Canadian
Conference on Computational Geometry, Lethbridge, Alberta, August 2002).

H. Bronnimann, J. Iacono, J. Katajainen, P. Morin, J. Morrison and G. T.
Toussaint, "Spaceefficient planar convex hull algorithms,"
Theoretical
Computer Science, Vol. 321/1, March 2004, pp. 2540.
2003

Greg Aloupis, Stefan Langerman, Michael Soss, and Godfried T. Toussaint,
"Algorithms for bivariate medians and a FermatToricelli
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. 6079.

J. Antonio Sellares and Godfried T. Toussaint, "On
the role of kinesthetic thinking in computational geometry," Journal
of Mathematical Education in Science and Technology, Vol. 34, No. 2,
2003, pp. 219237.

Godfried T. Toussaint, "Simple proofs of a geometric
property of fourbar linkages," American Mathematical Monthly,
Vol. 110, No. 6, JuneJuly 2003, pp. 482494.
2002

Prosenjit Bose, Suneeta Ramaswami, Godfried Toussaint and Alain Turki,"
Experimental
results on quadrangulations of sets of fixed points," Computer
Aided Geometric Design, Vol. 19, 2002, pp. 533552.

Elsa OmanaPulido and Godfried T. Toussaint, "Aperture
angle optimization problems in 3 dimensions," Journal of Mathematical
Modelling and Algorithms, Vol. 1, 2002, pp. 301329.

Oswin Aichholzer, Carmen Cortes, Erik Demaine, Vida Dujmovic, Jeff Erickson,
Henk Meijer, Mark Overmars, Belen Palop, Suneeta Ramaswami, and Godfried
Toussaint, "Flipturning
polygons," Discrete and Computational
Geometry, Vol. 28, 2002, pp. 231253.

Greg Aloupis, Carmen Cortes, Francisco Gomez, Michael Soss and Godfried
T. Toussaint, "Lower bounds for computing statistical
depth," Computational Statistics and Data Analysis, Vol.
40, 2002, pp. 223229. Also Tech. Report # SOCS01.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

Francisco Gomez, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristan and
Godfried T. Toussaint, "Implicit convex polygons,"
Journal
of Mathematical Modelling and Algorithms, Vol. 1, 2002, pp. 5785.

Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport,
Vera Sacristan, Thomas Shermer and Godfried T. Toussaint, "Finding
specified sections of arrangements: 2D results,"
Journal of Mathematical
Modelling and Algorithms, Vol. 1, 2002, pp. 316.

Prosenjit Bose, Ferran Hurtado, Elsa OmanaPulido, Jack Snoeyink and Godfried
Toussaint, "Some apertureangle optimization problems,"
Algorithmica,
Vol. 33, 2002, pp. 411435.

Therese Biedl, Eric Demaine, Martin Demaine, Sylvain Lazard, Anna Lubiw,
Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint and
Sue Whitesides, "A note on reconfiguring tree linkages:
trees can lock," Discrete Applied Mathematics, Vol. 117,
2002, pp. 293297.
2001

Francisco Gomez, Suneeta Ramaswami and Godfried T. Toussaint, "On
computing general position views of data in three dimensions," Journal
of Visual Communication and Image Representation, Vol. 12, No. 4, 2001,
pp. 387400.

Francisco Gomez, Ferran Hurtado, J. Antonio Sellares and Godfried T. Toussaint,
"Nice perspective projections,"
Journal
of Visual Communication and Image Representation, Vol. 12, 2001, pp.
387400.

Francisco Gomez, Ferran Hurtado, Antoni Sellares and Godfried Toussaint,
"On degeneracies removable by perspective projections,"
International
Journal of Mathematical Algorithms, Vol. 2, 2001, pp. 227248.

Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark
Overmars, Michael Soss and Godfried T. Toussaint, "Reconfiguring
convex polygons," Computational Geometry: Theory and Applications,
Vol. 20, Numbers 12, October 2001, pp. 8595.

Jorge Alberto Calvo, Danny Krizanc, Pat Morin, Michael Soss and Godfried
T. Toussaint, "Convexifying polygons with simple
projections," Information Processing Letters, Vol. 80, No.
2, 2001, pp. 8186. Also Technical Report SOCS00.4, July 2000.

Prosenjit Bose, Michael E. Houle and Godfried T. Toussaint, "Every
set of disjoint line segments admits a binary tree," Discrete
and Computational Geometry, Vol. 26, No. 3, August 2001, pp. 387410.

Therese Biedl, Eric Demaine, Marty Demaine, Sylvain Lazard, Anna Lubiw,
Joseph O'Rourke, Mark Overmars, Steve Robbins, Ileana Streinu, Godfried
T. Toussaint and Sue Whitesides, "Locked and unlocked
polygonal chains in three dimensions," Discrete and Computational
Geometry, Vol. 26, No. 3, August 2001, pp. 269281.

Godfried T. Toussaint, "A new class of stuck unknots
in Pol6," Contributions to Algebra and Geometry,
Vol. 42, No. 2, 2001, pp. 301306.

Thomas Fevens, Antonio Hernandez, Antonio Mesa, Patrick Morin, Michael
Soss and Godfried T. Toussaint, "Simple polygons
with an infinite sequence of deflations," Contributions to Algebra
and Geometry, Vol. 42, No. 2, 2001, pp. 307311.
2000

Michael Soss and Godfried T. Toussaint, "Geometric
and computational aspects of polymer reconfiguration," Journal
of Mathematical Chemistry, Vol. 27, No. 4, 2000, pp. 303318.

Ferran Hurtado, Vera Sacristan and Godfried T. Toussaint, "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.
1735.

Prosenjit Bose and Godfried T. Toussaint, "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. 3766
1999

Prosenjit Bose, Francisco Gomez, Pedro Ramos and Godfried T. Toussaint,
"Drawing nice projections of objects in space,"
Journal
of Visual Communication and Image Representation, Vol. 10, No. 2, June
1999, pp. 157172.

Binay K. Bhattacharya, Asish Mukhopadhyay and Godfried T. Toussaint, "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. 8196.
1998

Prosenjit Bose, Marc van Kreveld and Godfried T. Toussaint, "Filling
polyhedral molds," Computer Aided Design, Vol. 30, No. 4,
1998, pp. 245254.

S. Ramaswami, P. Ramos and G. T. Toussaint, "Converting
triangulations to quadrangulations," Computational Geometry:
Theory and Applications, Vol. 9, March 1998, pp. 257276.
1997

P. Bose and G. T. Toussaint, "Characterizing and
efficiently computing quadrangulations of planar point sets,"
ComputerAided
Geometric Design , vol. 14, 1997, pp. 763785.

B. Asberg, G. Blanco, P. Bose, J. GarciaLopez, M. Overmars, G. T. Toussaint,
G. Wilfong and B. Zhu, "Feasibility of design in
stereolithography," Algorithmica, Special Issue on Computational
Geometry in Manufacturing, vol. 19, No. 1/2, Sept/Oct, 1997, pp. 6183.

P. Bose, T. Shermer. G. T. Toussaint and B. Zhu, "Guarding
polyhedral terrains," Computational Geometry: Theory and Applications,
vol.7, No. 3, February 1997, pp. 173186.
1996

P. Bose, D. Bremner and G. T. Toussaint, "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. 291302.

D. Eu, E. Guevremont and G. T. Toussaint, "On envelopes
of arrangements of lines," Journal of Algorithms, vol. 21,
1996, pp. 111148.
1995

P. Bose and G. T. Toussaint, "Geometric
and computational aspects of gravity casting," ComputerAided
Design , vol. 27, No. 6, 1995, pp. 455464.

P. Bose and G. T. Toussaint, "Growing
a tree from its branches," Journal of Algorithms, vol. 19,
1995, pp. 86103.
1994

C. Iwamoto and G. T. Toussaint, "Finding Hamiltonian
circuits in arrangements of Jordan curves is NPcomplete,"
Information
Processing Letters, vol. 52, 1994, pp. 183189.

G. T. Toussaint, "A counterexample 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.
14.

P. Bose and G. T. Toussaint, "Geometric and computational
aspects of manufacturing processes," Computers & Graphics,
vol. 18, No. 4, 1994, pp. 487497.

D. Eu and G. T. Toussaint, "On approximating polygonal
curves in two and three dimensions," CVGIP: Graphical Models
and Image Processing, vol. 56, No. 3, May 1994, pp. 231246.

J.M. Robert and G. T. Toussaint, "Linear approximation
of simple objects," Computational Geometry: Theory and Applications,
vol. 4, 1994, pp. 2752.

G. T. Toussaint, "A counterexample to Tomek's consistency
theorem for a condensed nearest neighbor decision rule," Pattern
Recognition Letters, vol. 15, August 1994, pp. 797801.
1993

H. ElGindy, H. Everett and G. T. Toussaint, "Slicing
an ear using pruneandsearch," Pattern Recognition Letters,
vol. 14, No. 9, September 1993, pp. 719722.

G. T. Toussaint, "Editorial,"
Pattern Recognition
Letters, vol. 14, No. 9, September 1993, pp. 697702.

L. Devroye and G. T. Toussaint, "Convex hulls for
random lines," Journal of Algorithms, vol. 14, 1993, pp.
381394.

G. T. Toussaint, "A new look at Euclid's second proposition,"
The
Mathematical Intelligencer, vol. 15, No. 3, 1993, pp. 1223.

G. T. Toussaint, "Un nuevo vistazo a la segunda proposicion
de Euclides," Mathesis, vol. 9, 1993, pp. 265294.
1992

B. Bhattacharya, J. Czyzowicz, P. Egyed, I.
Stojmenovic, G. T. Toussaint and J. Urrutia, "Computing
shortest transversals of sets," International Journal of Computational
Geometry and Applications, vol. 2, No. 4, December 1992, pp. 417436.

G. T. Toussaint, "Computational
geometry," Proceedings of the IEEE, vol. 80, No. 9, September
1992, pp. 13471363.

J. W. Jaromczyk and G. T. Toussaint, "Relative
neighborhood graphs and their relatives,"
Proceedings of the
IEEE, vol. 80, No. 9, September 1992, pp. 15021517.
1991

G. T. Toussaint, "Efficient
triangulation of simple polygons," The Visual Computer, vol.
7, No. 55, September 1991, pp. 280295.

B. K. Bhattacharya and G. T. Toussaint, "Computing
shortest transversals," Computing, vol. 46, 1991, pp. 93119.

B. K. Bhattacharya, H. Everett and G. T. Toussaint,
"A counter example to a dynamic algorithm for convex
hulls of line arrangements," Pattern Recognition Letters,
vol. 12, March 1991, pp. 145147.

G. T. Toussaint, "A counterexample
to a convex hull algorithm for polygons," Pattern Recognition,
vol.24, No. 2, 1991, pp. 183184.

G. T. Toussaint, "Anthropomorphic
polygons," American Mathematical Monthly, January 1991, pp.
3135.
1990

X. Kong, H. Everett and G. T. Toussaint, "The
Graham scan triangulates simple polygons,"
Pattern Recognition
Letters, vol. 11, November 1990, pp. 713716.

D. Samuel and G. T. Toussaint, "Computing
the external geodesic diameter of a simple polygon," Computing,
vol. 44, 1990, pp. 119.

D. Rappaport, H. Imai, & G. T. Toussaint,
"Computing simple circuits from a set of line segments,"
Discrete
& Computational Geometry, vol. 5, 1990, pp. 289304.
1989

G. T. Toussaint, "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. 942.

G. T. Toussaint, "On separating
two simple polygons by a single translation," Discrete &
Computational Geometry, vol. 4, no. 3, 1989, pp. 265278.

H. ElGindy and G. T. Toussaint, "On
geodesic properties of polygons relevant to lineartime triangulation,"
The
Visual Computer, vol. 5, no. 1/2, March 1989, pp. 6874.
1988

W. Lenhart, R. Pollack, J. Sack, R. Seidel,
M. Sharir, S. Suri, G. Toussaint, S. Whitesides and C. Yap, "Computing
the link center of a simple polygon,"
Discrete & Computational
Geometry, vol. 3, 1988, pp. 281293.

M. E. Houle and G. T. Toussaint, "Computing
the width of a set," IEEE Trans. Pattern Analysis & Machine
Intelligence, vol. 10, no. 5, September 1988, pp. 761765.

B. K. Bhattacharya and G. T. Toussaint, "Fast
algorithms for computing the diameter of a finite planar set," The
Visual Computer, Vol. 3, No. 6, May 1988, pp.379388.

G. T. Toussaint, "Computational
geometry," editorial, The Visual Computer, Vol. 3, No. 6,
May 1988, pp.321322.
1987

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

David Avis, Teren Gum and Godfried T. Toussaint,
"Visibility between two edges of a simple polygon,"
The
Visual Computer, vol. 2, 1986, pp. 342357.

Godfried T. Toussaint, "A
lineartime algorithm for solving the stronghidden line problem in a simple
polygon," Pattern Recognition Letters, vol. 4, December 1986,
pp. 449451.
1985

Mary M. McQueen and Godfried T. Toussaint, "On
the ultimate convex hull algorithm in practice," Pattern Recognition
Letters, vol. 3, January 1985, pp. 2934.

Godfried T. Toussaint, "A
historical note on convex hull finding algorithms," Pattern Recognition
Letters, vol. 3, January 1985, pp. 2128.

David Rappaport and Godfried T. Toussaint,
"A simple linear hiddenline algorithm for starshaped
polygons," Pattern Recognition Letters, vol. 3, January 1985,
pp. 3539.

Michael McKenna and Godfried Toussaint, "Finding
the minimum vertex distance between two disjoint convex polygons in linear
time," Computers and Mathematics with Applications, vol.
11, No. 12, 1985, pp. 12271242.

Godfried T. Toussaint, "A
simple linear algorithm for intersecting convex polygons, The
Visual Computer, vol. 1, 1985, pp. 118123.
1984

Godfried T. Toussaint and Hossam A. ElGindy,
"Separation of two monotone polygons in linear time,"
Robotica,
vol. 2, 1984, pp.215220.

Godfried T. Toussaint, "Complexity,
convexity, and unimodality," International Journal of Computer
and Information Sciences, vol. 13, No. 3, June 1984, pp. 197217.

Godfried T. Toussaint, "An
optimal algorithm for computing the minimum vertex distance between two
crossing convex polygons," Computing, vol. 32, 1984, pp.
357364.

Godfried T. Toussaint, "A
new linear algorithm for triangulating monotone polygons," Pattern
Recognition Letters, vol. 2, March, 1984, pp. 155158.
1983

Godfried T. Toussaint, "On
the application of the convex hull to histogram analysis in threshold selection,"
Pattern
Recognition Letters, vol. 2, December, 1983, pp. 7577.

Godfried T. Toussaint and Binay K. Bhattacharya,
"Optimal algorithms for computing the minimum distance
between two finite planar sets," Pattern Recognition Letters,
vol. 2, December, 1983, pp. 7982.

Godfried T. Toussaint, "Computing
largest empty circles with location constraints," International
Journal of Computer and Information Sciences, vol. 12, No. 5, October,
1983, pp. 347358.

Binay K. Bhattacharya and Godfried T. Toussaint,
"Timeand storageefficient implementation of an
optimal planar convex hull algorithm," Image and Vision Computing,
vol. 1, No. 3, August, 1983, pp. 140144.

Godfried T. Toussaint, "The
symmetric allfurthestneighbor problem," Computers and Mathematics
with Applications, vol. 19, No. 6, 1983, pp. 747754.

Binay K. Bhattacharya and Godfried T. Toussaint,
"Efficient algorithms for computing the maximum distance
between two finite planar sets," Journal of Algorithms, vol.
14, 1983, pp. 121136.

Godfried T. Toussaint and Hossam ElGindy, "A
counter example to an algorithm for computing monotone hulls of simple
polygons," Pattern Recognition Letters, vol. 1, 1983, pp.
219222.

Hossam ElGindy, David Avis, and Godfried T.
Toussaint, "Applications of a twodimensional hiddenline
algorithm to other geometric problems," Computing, vol. 31,
1983, pp. 191202.
1982

Binay K. Bhattacharya and Godfried T. Toussaint,
"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. 161165.

Binay K. Bhattacharya and Godfried T. Toussaint,
"A counter example to a diameter algorithm for convex
polygons," IEEE Trans. Pattern Analysis and Machine Intelligence,
vol. PAMI4, No. 3, May 1982, pp. 306309.

Godfried T. Toussaint, "A
simple proof of Pach's extremal theorem for convex polygons," Pattern
Recognition Letters, vol. 1, 1982, pp. 8586.

David Avis, Godfried T. Toussaint, and Binay
K. Bhattacharya, "On the multimodality of distances
in convex polygons," Computers and Mathematics with Applications,
vol. 8, No. 2, 1982, pp. 153156.

Godfried T. Toussaint and Jim A. McAlear, "A
simple O(n log n) algorithm for finding the maximum distance between two
finite planar sets," Pattern Recognition Letters, vol. 1,
1982, pp. 2124.

Godfried T. Toussaint and David Avis, "On
a convex hull algorithm for polygons and its application to triangulation
problems," Pattern Recognition, vol. 15, No. 1, 1982, pp.
2329.
1981

David Avis and Godfried T. Toussaint, "An
efficient algorithm for decomposing a polygon into starshaped polygons,"
Pattern
Recognition, vol. 13, No. 6, 1981, pp. 395398.

Luc Devroye and Godfried T. Toussaint, "A
note on linear expected time algorithms for finding convex hulls,"
Computing,
vol. 26, 1981, pp. 361366.

David Avis and Godfried T. Toussaint, "An
optimal algorithm for determining the visibility of a polygon from an edge,"
IEEE
Transactions Computers, vol. C30, No. 12, December 1981, pp. 910914.

Godfried T. Toussaint, "Comment
on algorithms for computing relative neighborhood graph," Electronics
Letters, vol. 16, No. 22, October l981, pp. 860861.

Ron S. Poulsen, Leslie H. Oliver, Godfried T.
Toussaint and Claude Louis, "Evaluation of singlecell
classification schemes for computer classification of cervical cells,"
Analytic
& Quantitative Cytology, vol. 3, No. 3, September 1981, pp. 207215.
1980

Godfried T. Toussaint, "The
relative neighborhood graph of a finite planar set," Pattern
Recognition, vol. 12, 1980, pp.261268

Binay K. Bhattacharya and Godfried T. Toussaint,
"Comment on divergence and probability of error in
pattern recognition," Proceedings of the IEEE, vol. 68, April
1980, pp. 539540.

Rajjan Shinghal and Godfried T. Toussaint, "The
sensitivity of the modified Viterbi algorithm to the source statistics,"
IEEE
Trans. Pattern Analysis and Machine Intelligence, vol. PAMI2, March
1980, pp. 181185.
1979

Leslie H. Oliver, Ron S. Poulsen, Godfried T.
Toussaint and Claude Louis, "Classification of atypical
cells in the automatic cytoscreening for cervical cancer,"
Pattern
Recognition, vol. 11, 1979, pp. 205212.

Rajjan Shinghal and G.T. Toussaint, "Probabilities
of occurrence of characters, characterpairs, and charactertriplets in
English text," Bulletin of the Assoc. for Literary and Linguistic
Computing, vol. 6, 1978, pp. 245253.

Rajjan Shinghal and Godfried T. Toussaint, "A
bottomup and topdown approach to using context in text recognition,"
International
Journal of ManMachine Studies, vol. 11, 1979, pp. 201212.

R. Shinghal and Godfried T. Toussaint, "Experiments
in text recognition with the modified Viterbi algorithm," IEEE
Trans. Pattern Analysis and Machine Intelligence, vol. PAMIl, April
1979, pp. 184193.

Selim G. Akl and Godfried T. Toussaint, "Addendum
to an improved algorithm to check for polygon similarity," Information
Processing Letters, vol. 8, March 1979, pp. 157158.
1978

Selim G. Akl and Godfried T. Toussaint, "A
fast convex hull algorithm," Information Processing Letters,
vol. 7, August 1978, pp. 219222.

Godfried T. Toussaint, "Probability
of error, expected divergence, and the affinity of several distributions,"
IEEE
Trans. Systems, Man, and Cybernetics, vol. SMC8, June 1978, pp. 482485.

Rajjan Shinghal, David Rosenberg, and Godfried
T. Toussaint, "A simplified heuristic version of
a recursive Bayes algorithm for using context in text recognition,"
IEEE
Trans. Systems, Man, and Cybernetics, vol. SMC8, May 1978, pp.412414.

G. T. Toussaint, "The
use of context in pattern recognition," Invited paper, Pattern
Recognition, vol. 10, 1978, pp. 189204.

Selim G. Akl and Godfried T. Toussaint, "An
improved algorithm to check for polygon similarity,"
Information
Processing Letters, vol. 7, April 1978, pp. 127128.
1977

Godfried T. Toussaint, "An
upper bound on the probability of misclassification in terms of the affinity,"
Proceedings
of the IEEE, February 1977, pp. 275276.

GodfriedT. Toussaint, "A
generalization of Shannon's equivocation and the Fano bound," IEEE
Trans. Systems, Man, and Cybernetics, April 1977, pp. 300302.

Ron S. Poulsen, Leslie H. Oliver, Robert L.
Cahn, Claude Louis and Godfried T. Toussaint, "High
resolution analysis of cervical cells  a progress report," Journal
of Histochemistry and Cytochemistry, vol. 25, 1977, pp. 689695.

Robert L. Cahn, Ron S. Poulsen, and Godfried
T. Toussaint, "Segmentation of cervical cell images,"
Journal
of Histochemistry and Cytochemistry, vol. 25, 1977, pp. 681688.

Leslie H. Oliver, Ron S. Poulsen, and Godfried
T. Toussaint, "Estimating false positive and false
negative error rates in cervical cell classification,"
Journal
of Histochemistry and Cytochemistry, vol. 25, 1977, pp. 696701.

Mel Cohen and Godfried T. Toussaint, "On
the detection of structures in noisy pictures,"
Pattern Recognition,
vol. 9, pp. 9598, 1977.
1975

Godfried T. Toussaint, "Comments
on a new class of bounds on Bayes risk in multihypothesis pattern recognition,"
IEEE
Transctions on Computers, vol. C24, August 1975, p. 855.

Godfried T. Toussaint, "Sharper
lower bounds for discrimination information in terms of variation,"
IEEE
Transactions on Information Theory, January 1975, pp. 99100.

Godfried T. Toussaint, "Subjective
clustering and bibliography of books on pattern recognition," Information
Sciences, vol. 8, 1975, pp. 251257.

Godfried T. Toussaint and Patricia M. Sharpe,
"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. 269278.
1974

Godfried T. Toussaint, "Some
applications of generalizations of Pi," The Mathematical Gazette,
December 1974, pp. 291293.

Godfried T. Toussaint, "Some
properties of Matusita's measure of affinity of several distributions,"
Annals
of the Institute of Statistical Mathematics, vol. 26, 1974, pp. 389396.

Godfried T. Toussaint, "Comments
on the extraction of pattern features from imperfectly identified samples,"
IEEE
Trans. Computers, vol. C23, September 1974, pp. 988989.

Godfried T. Toussaint, "Bibliography
on estimation of misclassification," IEEE Trans. Information
Theory, vol. IT20, July 1974, pp. 472479.
1973

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

Godfried T. Toussaint, "Comments
on a comparison of seven techniques for choosing subsets of pattern recognition
properties," IEEE Trans. Computers, vol. C21, September
1972, pp. 10281029.

Godfried T. Toussaint, "Comments
on error bounds for a contextual recognition procedure," IEEE
Trans. Computers, vol. C21, September 1972, p. 1027.

Godfried T. Toussaint, "Feature
evaluation with quadratic mutual information," Information Processing
Letters, vol. 1, June 1972, pp. 153156.

Godfried T. Toussaint, "Comments
on the divergence and Bhattacharyya distance measures in signal selection,"
IEEE
Trans. Communication Technology, vol. COM20, June 1972, p. 485.

Godfried T. Toussaint, "Comments
on theoretical comparison of a class of feature selection criteria in pattern
recognition," IEEE Trans. Computers, vol. C21, June 1972,
pp. 615616.

Godfried T. Toussaint and Toomas R. Vilmansen,
"Comments on feature selection with a linear dependence
measure," IEEE Trans. Computers, vol. C21, April 1972, pp.
408.

Godfried T. Toussaint, "Some
inequalities between distance measures for feature evaluation,"
IEEE Trans. Computers, vol. C21, April 1972, pp. 409410.

Godfried T. Toussaint, "Polynomial
representation of classifiers with independent discretevalued features,"
IEEE Trans. Computers, vol. C21, February 1972, pp. 205208.

A. B. Shahidul Hussain, Godfried T. Toussaint,
and Robert W. Donaldson, "Results obtained using
a simple character recognition procedure on Munson's hand printed data,"
IEEE
Trans. Computers, vol. C21, February 1972, pp. 201205.
1971

Godfried T. Toussaint, "Some
functional lower bounds on the expected divergence for multhypothesis pattern
recognition, communication, and radar systems," IEEE Trans. Systems,
Man, and Cybernetics, vol. SMCl, October 1971, pp. 384385.

J.W. Carl and Godfried T. Toussaint, "Historical
note on Minkowski metric classifiers,"
IEEE Trans Systems, Man,
and Cybernetics, vol. SMCl, October 1971, pp. 387388.

Godfried T. Toussaint, "Comments
on a modified figure of merit for feature selection in pattern recognition,"
IEEE Trans. Information Theory, vol. IT17, September 1971, pp.
618620.

Godfried T. Toussaint, "Note
on optimal selection of independent binaryvalued features for pattern
recognition," IEEE Trans. Information Theory, vol. IT17,
September 1971, p. 618.

Godfried T. Toussaint, "Some
upper bounds on error probability for multiclass pattern recognition,"
IEEE
Trans. Computers, vol. C21, August 1971, pp. 943944.

Godfried T. Toussaint and A. B. Shahidul Hussain,
"Comments on a dynamic programming approach to the
selection of pattern features," IEEE Trans. Systems, Man, and
Cybernetics, vol. SMCl, April 1971, pp. 186187.
1970

Robert W. Donaldson and GodfriedT. Toussaint,
"Use of contextual constraints in recognition of
contourtraced hand printed characters," IEEE Trans. Computers,
vol. Cl9, November 1970, pp. 10961099.

Godfried T. Toussaint, "On
a simple Minkowski metric classifier," IEEE Trans. Systems Science
and Cybernetics, vol. SSC6, October 1970, pp. 360362.

Godfried T. Toussaint and Robert W. Donaldson,
"Algorithms for recognizing contourtraced hand printed
characters," IEEE Trans. Computers, vol. Cl9, June 1970,
pp. 541546.
1969

Godfried T. Toussaint, "Ultralinear
ramp generator uses UJT to drive Darlington," Electronic Design,
vol. 17, No. 21, October 1969, pp. 117119.