Publications in Conference Proceedings
Total number: 156
2006

Erik Demaine, Blaise Gassend, Joseph O'Rourke, and Godfried T. Toussaint,
"Polygons flip finitely: flaws and a fix,"
Proceedings
of the 18th Canadian Conference on Computational Geometry, Queen's
University, Kingston, Ontario, Canada, August 1416, 2006.

Mirela Damian, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Dania
ElKhechen, Robin Flatland, John Iacono, Stefan Langerman, Henk Meijer,
Suneeta Ramaswami, Diane L. Souvaine, Perouz Taslakian and Godfried T.
Toussaint, "Curves in the sand: algorithmic drawing,"
Proceedings
of the 18th Canadian Conference on Computational Geometry, Queen's
University, Kingston, Ontario, Canada, August 1416, 2006.

Erik Demaine, Martin Demaine, Perouz Taslakian, and Godfried T. Toussaint,
"Sand drawings and Gaussian graphs,"
Proceedings
of BRIDGES: Mathematical Connections in Art, Music, and Science, London,
United Kingdom, August 48, 2006.

Jakob Teitelbaum and Godfried T. Toussaint, "RHYTHMOS:
an interactive system for exploring rhythm from the mathematical and musical
points of view," Proceedings of BRIDGES: Mathematical Connections
in Art, Music, and Science, London, United Kingdom, August 48, 2006.

Justin Colannino, Francisco Gomez, and Godfried T. Toussaint, "
Steve Reich's Clapping Music and the Yoruba bell timeline,"
Proceedings of BRIDGES: Mathematical Connections in Art, Music, and
Science, London, United Kingdom, August 48, 2006.
2005

Binay Bhattacharya, Kaustav Mukherjee and Godfried Toussaint, "Geometric
decision rules for instancebased learning algorithms," Proceedings
Pattern Recognition and Machine Intelligence: First International, Conference,
S. K. Pal et al., (Eds.): LNCS 3776, Kolkata, India, December, 2022, 2005,
pp. 6069.

Godfried Toussaint, "The geometry of musical rhythm,"
Proceedings of the Japan Conference on Discrete and Computational Geometry,
J. Akiyama et al. (Eds.), LNCS 3742, SpringerVerlag, Berlin, Heidelberg,
2005, pp. 198212.

Godfried Toussaint, "Mathematical features for recognizing
preference in SubSaharan African traditional rhythm timelines,"
3rd
International Conference on Advances in Pattern Recognition, University
of Bath, Bath, United Kingdom, August 2225, 2005, pp. 1827.

Erik Demaine, Francisco GomezMartin, Henk Meijer, David Rappaport, Perouz
Taslakian, Godfried Toussaint, Terry Winograd and David Wood, "The
distance geometry of deep rhythms and scales," Proceedings of
the 17h Canadian Conference on Computational Geometry, University of
Windsor, Windsor, Ontario, Canada, August 1012, 2005, pp. 160163.

Justin Colannino and Godfried Toussaint, "Faster
algorithms for computing distances between onedimensional point sets,"
Proceedings
of the XI Encuentros de Geometria Computacional, Editors: Francisco
Santos and David Orden, Servicio de Publicaciones de la Universidad de
Cantabria, Santander, Spain, June 2729, 2005, pp. 189198.

Godfried T. Toussaint, "The Euclidean algorithm
generates traditional musical rhythms," Proceedings of BRIDGES:
Mathematical Connections in Art, Music, and Science, Banff, Alberta,
Canada, July 31 to August 3, 2005, pp. 4756.

Francisco Gomez, Andrew Melvin, David Rappaport, and Godfried T. Toussaint,
"Mathematical measures of syncopation,"
Proceedings
of BRIDGES: Mathematical Connections in Art, Music, and Science, Banff,
Alberta, Canada, July 31 to August 3, 2005, pp. 7384.

Binay Bhattacharya, Kaustav Mukherjee and Godfried Toussaint, "Geometric
decision rules for high dimensions," Proceedings of the
55th Session of the International Statistics Institute, Sydney, Australia,
April 512, 2005 (invited paper).
2004

Perouz Taslakian and Godfried T. Toussaint, "Hamiltonian
cycles in sparse vertexadjacency duals," Abstracts of the 14th
Annual Fall Workshop on Computational Geometry, Massachussetts Institute
of Technology, November 1920, 2004, pp. 3031.

Godfried T. Toussaint, "Computational geometric aspects
of musical rhythm," Abstracts of the 14th Annual Fall Workshop
on Computational Geometry, Massachussetts Institute of Technology,
November 1920, 2004, pp. 4748.

JoseMiguel DiazBanez, Giovanna Farigu, Francisco Gomez, David Rappaport,
and Godfried Toussaint, "Analisis filogenetico del
compas flamenco," Proceedings of XXXII Congreso Internacional
de Arte Flamenco, Mairena del Alcor, Sevilla, Spain, September, 2004
(invited paper in Spanish).

Greg Aloupis, Erik Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke,
Ileana Streinu and Godfried Toussaint, "Unfolding
polyhedral bands," Proceedings of the 16th Canadian Conference
on Computational Geometry, Concordia University, Montreal, Quebec,
Canada, August 911, 2004, pp. 6063.

Godfried T. Toussaint, "A comparison of rhythmic
similarity measures," Proceedings of ISMIR 2004: 5th International
Conference on Music Information Retrieval, Universitat Pompeu Fabra,
Barcelona, Spain, October 1014, 2004, pp. 242245.

Miguel DiazBanez, Giovanna Farigu, Francisco Gomez, David Rappaport, and
Godfried T. Toussaint, "El compas flamenco: A phylogenetic
analysis," Proceedings of BRIDGES: Mathematical Connections in
Art, Music, and Science, Southwestern College, Winfield, Kansas, July
30 to August 1, 2004, pp. 6170.
2003

Godfried T. Toussaint, "Open problems in geometric
methods for instancebased learning," in Discrete and Computational
Geometry, Japanese Conference, JCDCG 2002, Tokyo, Japan, December 69,
2002, Editors: Jin Akiyama and Mikio Kano, SpingerVerlag, BerlinHeidelberg,
2003, pp. 273283.

Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa,
Yurai Nunez, David Rappaport and Godfried Toussaint, "Computing
a geometric measure of the similarity between two melodies," Proceedings
of the 15th Canadian Conference on Computational Geometry," Dalhousie
University, Halifax, Nova Scotia, Canada, August 1113, 2003, pp. 8184.

Ferran Hurtado, Godfried T. Toussaint, and Joan Trias, "On
polyhedra induced by point sets in space," Proceedings of the
15th Canadian Conference on Computational Geometry," Dalhousie University,
Halifax, Nova Scotia, Canada, August 1113, 2003, pp. 107110.

David Bremner, Erik Demaine, Jeff Erickson, John Iacono, Stefan Langerman,
Pat Morin, and Godfried Toussaint, "Outputsensitive
algorithms for computing nearestneighbour decision boundaries,"
Algorithms
and Data Structures, F. Dehne, J.R. Sack and M. Smid (Eds.), 8th International
Workshop, July 30  August 1, 2003, Ottawa, Ontario, Canada, SpringerVerlag,
LNCS 2748, pp. 451461, 2003.

Godfried T. Toussaint, "Classification and phylogenetic
analysis of African ternary rhythm timelines,"
Proceedings of
BRIDGES: Mathematical Connections in Art, Music, and Science, University
of Granada, Granada, Spain July 2327, 2003, pp. 2536.

Godfried T. Toussaint, "Algorithmic, geometric, and
combinatorial problems in computational music theory,"
Proceedings
of X Encuentros de Geometria Computacional, University of Sevilla,
Sevilla, Spain, June 1617, 2003, pp. 101107.

Godfried T. Toussaint, "Geometric graphs for improving
nearest neighbor decision rules," in Computational Science and
its Applications, Eds. V. Kumar, M. L. Gavrilova, C. J. K. Tan and
P. L'Ecuyer, ICCSA 2003, LNCS 2669, SpringerVerlag, 2003, pp. 762765.
2002

Greg Aloupis, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Stefan Langerman,
Henk Meijer, Ileana Streinu, Joseph O'Rourke, Mark Overmars, Michael Soss
and Godfried T. Toussaint, "Flatstate connectivity
of linkages under dihedral motions," Proceedings of ISAAC2002,
The 13th Annual International Symposium on Algorithms and Computation,
LNCS Vol. 2518, Vancouver, Canada, November 2023, 2002, pp. 369380.

Benjamin Marlin and Godfried Toussaint, "Constructing
convex 3polytopes from two triangulations of a polygon," Proceedings
of the 14th Canadian Conference on Computational Geometry, University
of Lethbridge, Lethbridge, Alberta, Canada, August 1214, 2002, pp. 3639.

Greg Aloupis, Prosenjit Bose, Erik Demaine, Stefan Langerman, Henk Meijer,
Mark Overmars and Godfried Toussaint, "Computing
signed permutations of polygons," Proceedings of the 14th Canadian
Conference on Computational Geometry, University of Lethbridge, Lethbridge,
Alberta, Canada, August 1214, 2002, pp. 6871.

Greg Aloupis, Erik Demaine, Henk Meijer, Joseph O'Rourke, Ileana Streinu
and Godfried Toussaint, "On flatstate connectivity
of chains with fixed acute angles," Proceedings of the 14th Canadian
Conference on Computational Geometry, University of Lethbridge, Lethbridge,
Alberta, Canada, August 1214, 2002.

Godfried T. Toussaint, "A mathematical analysis of
African, Brazilian, and Cuban clave rhythms,"
Proceedings
of Bridges: Mathematical Connections in Art, Music, and Science, Towson
University, Baltimore, Maryland, July 2729, 2002, pp. 157168.

Godfried T. Toussaint, "Proximity graphs for nearest
neighbor decision rules: recent progress,"
Interface2002, 34th
Symposium on Computing and Statistics
(theme: Geoscience and remote
Sensing), RitzCarlton Hotel, Montreal, Canada, April 1720, 2002.

H. Bronnimann, J. Iacono, J. Katajainen, P. Morin, J. Morrison and G. T.
Toussaint, "Optimal inplace planar convex hull algorithms,"
Proceedings of Latin American
Theoretical
INformatics,
LATIN2002, Cancun, Mexico, April 36, 2002, pp. 494507.
2001

Greg Aloupis, Stefan Langerman, Michael Soss and Godfried T. Toussaint,
"Algorithms for bivariate medians and a FermatToricelli
problem for lines," Proceedings of the 13th Canadian Conference
on Computational Geometry, (extended abstract) Waterloo, Ontario, Canada,
August 1315, 2001, pp. 2124.
2000

Godfried T. Toussaint, "Advances in computational
geometry for document analysis," Proceedings Fourth International
Workshop on Document Analysis Systems (DAS'2000), Rio de Janeiro, Brazil,
December 1013, 2000, pp. 2540.

Oswin Aichholzer, Carmen Cortes, Erik Demaine,Vida Dujmovic, Jeff Erickson,
Henk Meijer, Mark Overmars, Belen Palop, Suneeta Ramaswami and Godfried
Toussaint, "Flipturning polygons,"
Proceedings
of the Japan Conference on Discrete and Computational Geometry (JCDCG 2000),
November 2225, 2000, Tokay University, Tokyo, pp. 107108.

Oswin Aichholzer, Erik Demaine, Jeff Erickson, Ferran Hurtado, Mark Overmars,
Michael Soss and Godfried Toussaint, "Reconfiguring
convex polygons," Proceedings of the 12th Canadian Conference
on Computational Geometry, (extended abstract) Fredericton, New Brunswick,
Canada, August 1619, 2000, pp. 1720.

Godfried T. Toussaint, "The complexity of computing
nice viewpoints of objects in space," Keynote
Address, Proceedings of Vision Geometry IX, SPIE
International Symposium on Optical Science and Technology, San Diego,
California, 30 July to 4 August 2000, pp. 111.
1999

Godfried T. Toussaint, "The ErdosNagy theorem and
its ramifications," Proceedings of the 11th Canadian Conference
on Computational Geometry, (extended abstract) Vancouver, Canada, August
1618, 1999, pp. 912.

Godfried T. Toussaint, "Computational polygonal entanglement
theory," Proceedings of the VIII Encuentros de Geometria Computacional,
Castellon, Spain, July 79, 1999, pp. 269278.

T. Biedl, E. Demaine, M. Demaine, S. Lazard, A. Lubiw, J. O'Rourke, M.
Overmars, S. Robbins, I. Streinu, Godfried T. Toussaint and S. Whitesides,
"Locked and unlocked polygonal chains in 3d,"
Proceedings of the 10th Annual ACMSIAM Symposium on Discrete Algorithms,
Baltimore, USA, January 1719, 1999, pp. 866867.
1998

T. Biedl, E. Demaine, M. Demaine, H. Everett, S. Lazard, A. Lubiw, J. O'Rourke,
S. Robbins, I. Streinu, G. T. Toussaint and S. Whitesides, "On
reconfiguring tree linkages: Trees can lock,"
Proceedings of
the 10th Canadian Conference on Computational Geometry, McGill University,
Montreal, Canada, August 1012, 1998, pp. 45.

T. Biedl, E. Demaine, M. Demaine, A. Lubiw, and G. T. Toussaint, "Hiding
disks in folded polygons," Proceedings of the 10th Canadian Conference
on Computational Geometry, McGill University, Montreal, Canada, August
1012, 1998, pp. 3637.

P. Bose, F. Hurtado, H. Meijer, S. Ramaswami, D. Rappaport, V. Sacristan,
T. Shermer and G. T. Toussaint, "Finding specified
sections of arrangements: 2D results," Proceedings of the 10th
Canadian Conference on Computational Geometry, McGill University, Montreal,
Canada, August 1012, 1998, pp. 2021.

F. Gomez, F. Hurtado, T. Sellares and G. T. Toussaint, "Perspective
projections and removal of degeneracies," Proceedings of the
10th Canadian Conference on Computational Geometry, McGill University,
Montreal, Canada, August 1012, 1998, pp. 100101.

F. Hurtado, V. Sacristan and G. T. Toussaint, "Constrained
facility location," Proceedings of the 10th Canadian Conference
on Computational Geometry, McGill University, Montreal, Canada, August
1012, 1998, pp. 2425.

E. OmanaPulido and G. T. Toussaint, "Apertureangle
optimization problems in 3 dimensions," Proceedings of the 10th
Canadian Conference on Computational Geometry, McGill University, Montreal,
Canada, August 1012, 1998, pp. 9697.

F. Gómez, F. Hurtado, J. A. Sellares and G. T. Toussaint, "Verificación
de imágenes geometricas,"
CEIG'98, Actas del VIII Congreso
Español de Informática Gráfica, Ourense, Spain,
June 1719, 1998, pp. 163176.

F. Gomez, F. Hurtado, and G. T. Toussaint, "Nice
projections and object reconstruction," Proceedings
of the Second International Conference on Mathematics and Design,
San Sebastian, Spain, June 14, 1998, pp. 441450.
1997

F. Hurtado, V. Sacristan and G. T. Toussaint, "Angulo
de apertura en la vision en dos y tres dimensiones," VII Encuentros
de Geometria Computacional, Madrid, July 79, 1997, pp. 1528.

F. Gomez, S. Ramaswami and G. T. Toussaint, "On removing
nondegeneracy assumptions in computational geometry,"
Proc.
Italian Conference on Algorithms, March 1214, 1997, Rome, Italy, pp.
5263.
1996

P. Bose and G. T. Toussaint, "Computing the constrained
Euclidean, geodesic and link centers of a simple polygon with applications,"
Proc. Computer Graphics International (CGI'96) , Pohang, Korea,
June 2428, 1996, pp. 102112.

F. Gómez, F. Hurtado and G. T. Toussaint, "Proyecciones
de calidad y reconstrucción de conjuntos," CEIG'96, Actas
del VI Congreso Español de Informática Gráfica,
Valencia, Spain, June 2628, 1996, pp. 1932.

D. Avis, P. Bose, T. Shermer, J. Snoeyink, G. T. Toussaint and B. Zhu,
"On the sectional area of convex polytopes,"
Proc.
12th ACM Symposium on Computational Geometry, Philadelphia, May 2426,
1996, pp. C11C12.
1995

P. Bose and G. T. Toussaint, "No
quadrangulation is extremely odd," Proc. 6th Annual International
Symposium on Algorithms and Computation (ISAAC'95) , Cairns, Australia,
Dec. 46, 1995, pp. 372381.

P. Bose, F. Gomez, P. Ramos and G. T. Toussaint,
"Drawing nice projections of objects in space,"
Proc. Graph Drawing'95, Passau, Germany, September 1995, pp. 5263.

G. T. Toussaint, "Quadrangulations
of planar sets," Proc. 4th International Workshop on Algorithms
and Data Structures (WADS'95), Kingston, Canada, August 1618, 1995,
pp. 218227.

S. Ramaswami, P. Ramos and G. T. Toussaint, "Converting
triangulations to quadrangulations,"
Proc. 7th C anadian Conference
on Computational Geometry, Quebec City, Canada, August 1014, 1995,
pp. 297302.

P. Bose, F. HurtadoDiaz, E. OmanaPulido and
G. T. Toussaint, "Some apertureangle optimization
problems," Proc. 7th C anadian Conference on Computational Geometry,
Quebec City, Canada, August 1014, 1995, pp. 7378.

G. T. Toussaint, "Quadrangulations,"
Actas
de Los VI Encuentros de Geometria Computacional, Universidad Politecnica
de Catalunya, Barcelona, Spain, July 57, 1995, pp. 5158.

P. Bose, F. Gomez, P. Ramos and G. T. Toussaint,
"Drawing nice projections of objects in space,"
Actas de Los VI Encuentros de Geometria Computacional, Universidad
Politecnica de Catalunya, Barcelona, Spain, July 57, 1995, pp. 102108.

E. P. OmañaPulido and G. T. Toussaint,
"Algunos problemas de optimizacion del angulo de
apertura en el espacio euclideano tridimensional,"
Actas de Los
VI Encuentros de Geometria Computacional, Universidad Politecnica de
Catalunya, Barcelona, Spain, July 57, 1995, pp. 257262.

1994

C. Pateras and G. T. Toussaint, "Bamboo
fields: A new proximity graph and its application to textline orientation
estimation in document analysis," Proc. Third Workshop on Proximity
Graphs, Mississippi State University, Starkville, Mississippi, December
13, 1994, Eds., D. W. Dearholt and M. J. Lipman, pp. 73120.

P. Bose and G. T. Toussaint, "Proximity
graphs on line segments," Proc. Third Workshop on Proximity Graphs,
Mississippi State University, Starkville, Mississippi, December 13, 1994,
Eds., D. W. Dearholt and M. J. Lipman, pp. 3152.

P. Bose, M. E. Houle and G. T. Toussaint, "Every
set of disjoint line segments admits a binary tree," Proc. Fifth
International Symposium on Algorithms and Computation, Beijing, China,
August 2527, 1994, pp. 2028.

P. Bose and G. T. Toussaint, "Computational
geometry for CAD/CAM," Proc. Second Pacific Conference on Computer
Graphics and Applications, (Pacific Graphics `94) Beijing, China, August
2629, 1994, pp. 279291.

G. T. Toussaint, "Computing
extremal sections of convex polyhedra," Proc. Sixth Australasian
Workshop on Combinatorial Algorithms, Darwin, Australia, June 2025,
1994, pp. 1720.

G. Blanco, H. Everett, J. GarciaLopez and G.
T. Toussaint, "Illuminating the free space between
quadrilaterals with point light sources," Proc. Computer Graphics
International `94, Melbourne, Australia, June 27  July 1, 1994, pp.

P. Bose and J. T. Toussaint, "Geometric
and computational aspects of manufacturing processes," Proc.
International Conference on Computer Aided Geometric Design, July 48,
1994, Penang, Malaysia, pp.

C. Iwamoto and G. T. Toussaint, "Finding
Hamiltonian circuits in arrangements of Jordan curves is NPcomplete,"
Proc. Sixth Canadian Conference on Computational Geometry, Saskatoon,
Saskatchewan, August 26, 1994, pp. 9398.

P. Bose, D. Bremner and G. T. Toussaint, "All
convex polyhedra can be clamped with parallel jaw grippers," Proc.
Sixth Canadian Conference on Computational Geometry, Saskatoon, Saskatchewan,
August 26, 1994, pp. 345349.

G. T. Toussaint, "Computational
geometry for document analysis," Third Annual Symposium on Document
Analysis and Information Retrieval, Alexis Park Hotel, Las Vegas, Nevada,
April 1113, 1994, pp. 2342.
1993

B. Asberg, G. Blanco, P. Bose, J. GarciaLopez,
M. Overmars, G. T. Toussaint, G. Wilfong and B. Zhu, "Feasibility
of design in stereolithography," Proc. 13th Conf. Foundations
of Software Technology and Theoretical Computer Science, Bombay, December
1517, 1993, SpringerVerlag LNCS vol. 761, pp. 228237.

P. Bose and G. T. Toussaint, "Growing
a tree from its branches," Computer Graphics and Applications, Eds.,
S. Y. Shin and T. L. Kunii, Proc. First Pacific Conference on Computer
Graphics and Applications, August 30September 11, 1993, Seoul, Korea,
pp. 9099.

P. Bose and G. T. Toussaint, "Geometric
and computational aspects of injection molding," Proc. Third
International Conference on CAD and Computer Graphics, August 2326,
1993, Beijing, China, pp. 237242.

P. Bose, M. van Kreveld and G. T. Toussaint,
"Filling polyhedral molds,"
Proc. Third
Workshop on Algorithms and Data Structures, August 1113, 1993, Montreal,
Canada, pp. 210221.

G. T. Toussaint, C. Verbrugge, C. Wang and B.
Zhu, "Tetrahedralization of simple and nonsimple
polyhedra," Proc. Fifth Canadian Conference on Computational
Geometry, August 59, 1993, University of Waterloo, Canada, pp. 2429.

G. Blanco, H. Everett, J. GarciaLopez and G.
T. Toussaint, "Iluminación de cuadriláteros
en el plano," IV Encuentro de Geometria Computacional, Granada,
Spain, May 31 to June 1, 1993, pp. 2735.

P. Bose, F. HurtadoDíaz, E. OmañaPulido
and G. T. Toussaint, "Algunos problemas de optimizacion
de ángulos de apertura," Proc. IV Encuentro de Geometria
Computacional, Granada, Spain, May 31 to June 1, 1993, pp. 3744.
1992

D. Eu and G. T. Toussaint, "Polygonal
approximation of curves," SPIE Conference on Vision Geometry,
Boston, Mass., November 1516, 1992.

P. Bose, T. Shermer. G. T. Toussaint and B. Zhu,
"Guarding polyhedral terrains," Proc. Allerton
Conference, UrbanaChampaign, Illinois, October 1992.

G. T. Toussaint, "The use
of proximity graphs in image analysis and computer vision,"
Proc.
Canadian Conference on Electrical and Computer Engineering, Toronto,
Ontario, September 1316, 1992, pp. MM5.3.1MM5.3.4.

D. Eu, E. Guevremont and G. T. Toussaint, "On
classes of arrangements of lines," Proc. Fourth Canadian Conference
on Computational Geometry, St. Johns, Newfoundland, August 1014, 1992,
pp. 109114.

J.M. Robert and G. T. Toussaint, "Linear
approximation of simple objects,"
Proc. 9th Annual Symposium
on Theoretical Aspects of Computer Science (STACS'92), Cachann France,
February 1992, A. Finkel and M. Jantzen (eds.), Lecture Notes in Computer
Science #577, pp. 233244.
1991

G. T. Toussaint, "Computing
morphological properties of arrangements of lines," Proc. 2nd
Japan International Symposium of the Society for the Advancement of Materials
and Process Engineering, Chiba, Japan, December 1114, 1991, pp. 14061411.

B. K. Bhattacharya, A. Mukhopadhyay and G. T.
Toussaint, "A lineartime algorithm for computing
the shortest line segment from which a polygon is weakly externally visible,"
in Proc. Workshop on Algorithms and Data Structures, F. Dehne, J.
R. Sack and N. Santoro, (Eds.), Ottawa, Canada, August 1416, 1991, pp.
412424.

M. Keil and G. T. Toussaint, "Detecting
and computing intersections of convex chains," Proc. Third Canadian
Conference on Computational Geometry, Vancouver, August 610, 1991,
pp. 710.

B. Bhattacharya, P. Egyed and G. T. Toussaint,
"Computing the wingspan of a butterfly,"
Proc.
Third Canadian Conference on Computational Geometry, Vancouver, August
610, 1991, pp. 8891.

B. K. Bhattacharya and G. T. Toussaint, "Computing
shortest transversals," Proc. ICALP '91, Madrid, Spain, July
812, 1991.

B. K. Bhattacharya, J. Czyzowicz, P. Egyed, I.
Stojmenovic, G. T. Toussaint and J. Urrutia, "Computing
shortest transversals of sets," Proc. Seventh Annual ACM Symposium
on Computational Geometry, June 1012, 1991, North Conway, New Hampshire,
pp. 7180.

J. Czyzowics, P. Egyed, H. Everett, D. Rappaport,
T. Shermer, D. Souvaine, G. T. Toussaint and J. Urrutia, "The
aquarium keeper's problem," Proc. ACM/SIAM Symposium on Discrete
Algorithms, January 2830, 1991, pp. 459464.

Godfried T. Toussaint, "Computing
geometrical and graphtheoretical properties of line arrangements,"
Proceedings
of the 6th Caribbean Conference on Combinatorics and Computing, St.
Augustine, Trinidad, West Indies, January 710, 1991, pp, 260270.
1990

J. M. Robert and G. T. Toussaint, "Computational
geometry and facility location,"
Proc. International Conference
on Operations Research and Management Science, Manila, The Philippines,
Dec. 1115, 1990, pp. B1 to B19.

H. Everett and G. T. Toussaint, "Illuminating
objects in the plane with point light sources," Proc. Third Australasian
Workshop on Combinatorial Algorithms, Ubud, Indonesia, June 1115,
1990.

G. T. Toussaint, "An outputcomplexitysensitive
polygon triangulation algorithm," in
Computer Graphics International'90,
T. S. Chua & T. L. Kunii, (Eds.), SpringerVerlag, Singapore, June
2630, 1990, pp. 443466.
1989

Godfried T. Toussaint, "Some unsolved problems on
proximity graphs," Proceedings of the First Workshop on Proximity
Graphs, Las Cruces, New Mexico, November 30  December 2, 1989, pp.
188192.

Godfried T. Toussaint, "Computational geometry: Recent
developments," Proceedings of the Seventh International Conference
of the Computer Graphics Society, University of Leeds, United Kingdom,
June 2730, 1989, Rae A. Earnshaw and Brian Wyvill, Eds., SpringerVerlag,
Tokyo, 1989, pp. 2351.

B. K. Bhattacharya, D. G. Kirkpatrick and G.
T. Toussaint, "Determining sector visibility of a
polygon," Proceedings of the Fifth Annual ACM Symposium on Computational
Geometry, June 57, 1989, Saarbrucken, Germany, pp. 247253.

T. Shermer and G. T. Toussaint, "Anthropomorphic
polygons can be recognized in linear time," Proceedings of the
International Conference on Computing and Information, Toronto, May
2327, 1989, pp. 117123.
1988

Godfried T. Toussaint and Hossam ElGindy, "Computing
linkdistance properties inside a simple polygon," Proceedings
of the Fifth Caribbean Conference on Combinatorics and Computing, University
of West Indies, Cave Hill, Barbados, January 48, 1988, pp. 156167.

Hossam ElGindy and Godfried T. Toussaint, "On
triangulating palm polygons in linear time," Proceedings of Computer
Graphics International'88, Geneva, Switzerland, May 2427, 1988.

Godfried T. Toussaint, "Computing
visibility properties of polygons," In Pattern Recognition and
Artificial Intelligence, Editors: E. S. Gelsema and L. N. Kanal, Proceedings
of Pattern Recognition in Practice III, Amsterdam, May 1820, 1988,
pp. 103122.
1987

Hossam A. ElGindy and Godfried T. Toussaint,
"On computing and updating triangulations,"
Proceedings
of the International Conference on Foundations of Data Organization,
Kyoto, Japan, May 2224, 1985, In Foundations of Data Organization, Editors:
Sakti P. Ghosh, Yahiko Kambayashi and Katsumi Tanaka, Plenum Press, New
York, 1987, pp. 249262.

Binay K. Bhattacharya and Godfried T. Toussaint, "Fast
algorithms for computing the diameter of a finite planar set," In
Computer
Graphics, Editor: Tosiyasu L. Kunii, Proceedings of the Fifth International
Conference on Computer Graphics, Karuizawa, Japan, December 1987, pp.
89104.

M. Mansouri and G. T. Toussaint, "On the reachability
region of a ladder in two convex polygons," Proc. 13th IFIP Conference
on System Modelling and Optimization, Tokyo, Japan, September 1, 1987,
365374.

G. T. Toussaint, "Some collision avoidance problems
in the plane, "Proc. NATO ASI on Theoretical Foundations of Computer
Graphics and CAD, Il Ciocco, Italy, July 417, 1987, pp.639672.

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," Third ACM Symposium on Computational Geometry,
University of Waterloo, June 810, 1987, pp.110.
1986

Godfried T. Toussaint, "Shortest
path solves translation separability of polygons," Intelligent
Autonomous Systems: An International Conference, Elsevier Science Publishers,
Amsterdam, The Netherlands, December 811, 1986, pp. 590600.

Godfried T. Toussaint, "An
optimal algorithm for computing the relative convex hull of a set of points
in a polygon," Signal Processing III: Theories and Applications,
Proceedings of EURASIP86, Part 2, NorthHolland, September 1986, pp.
853856.

Godfried T. Toussaint, "On
the complexity of approximating polygonal curves in the plane,"
Proceedings
of IASTED International Symposium on Robotics and Automation,
Lugano,
Switzerland, June 2426, 1986, pp. 5962.

Minou Mansouri and Godfried T. Toussaint, "Translation
queries for convex polygons,"
Proceedings of IASTED International
Symposium on Robotics and Automation, Lugano, Switzerland, June 2426,
vol. 1, No. 3, 1986, pp.9095.

Tetsuo Asano and Godfried T. Toussaint, "Computing
the geodesic center of a simple polygon,"
Proceedings of the
JapanUS Joint Seminar on Discrete Algorithms and Complexity, Kyoto,
Japan, June 46, 1986, pp. 6580.
1985

G. T. Toussaint, "Computational
geometry and morphology," First International Symposium for Science
on Form, Tsukuba, Japan, November 2630, 1985.

G. T. Toussaint, "Some
collision avoidance problems between spheres," Proc. International
Conference on Systems, Man, and Cybernetics, Tucson, November 1215,
1985.

G. T. Toussaint, "Recent
results in collision avoidance problems," Proceedings of COMPINT85
(Computer Aided Technologies) , Montreal, September 812, 1985, pp.
194197.

Godfried T. Toussaint, "On the complexity of approximating
polygonal curves in the plane," Proceedings of IASTED International
Symposium on Robotics and Automation, Lugano, Switzerland, June 2426,
1985, pp. 5962.

Minou Mansouri and Godfried T. Toussaint, "Translation
queries for convex polygons," Proceedings of IASTED International
Symposium on Robotics and Automation, Lugano, Switzerland, June 2426,
1985, pp. 1216.

G. T. Toussaint, "New results
in computational geometry relevant to pattern recognition in practice,"
Proc.
Pattern Recognition in PracticeII, Amsterdam, June 1921, 1985.

M.E. Houle and G. T. Toussaint, "Computing
the width of a set," Proc. Symposium on Computational Geometry,
Baltimore, June 57, 1985, pp. 17.

G. T. Toussaint and H. A. ElGindy, "Two
monotone polygons can be separated in linear time," Proc. IPS/ACI
CONGRES 85, Montreal, June 35, 1985.

J. R. Sack and G. T. Toussaint, "Translating
polygons in the plane," Proc. STACS'85, Lecture Notes in
Computer Science #182, SpringerVerlag, Heidelberg, 1985, pp. 310321.
1984

G. T. Toussaint, "An optimal
algorithm for computing the minimum vertex distance between two crossing
convex polygons," Proc. Seventh InternationalConference on Pattern
Recognition, Montreal, July 30August 2, 1984, pp. 465467.

H. A. ElGindy and G. T. Toussaint, "On
triangulations of line segments," Proc. Int. AMSE Conf. Modelling
and Simulation, Athens, Greece, June 2729 1984, vol. 1.3, pp. 83107.

G.T. Toussaint, B.K. Bhattacharya, and R.S. Poulsen,
"The application of Voronoi diagrams to nonparametric
decision rules," Proc. Computer Science and Statistics: 16th
Symposium on the Interface, Atlanta, Georgia, March 1416,1984, Published
by NorthHolland in 1985, Amsterdam, L. Billard, Ed., pp. 97108.
1983

G.T. Toussaint and J.R. Sack, "Some
new results on moving polygons in the plane," Proceedings of
Robotic Intelligence and Productivity Conference, Detroit, Michigan,
November 1819, 1983, pp. 158163.

G.T. Toussaint, "Computing
largest empty circles with location constraints," Proceedings
of the Allerton Conference, Monticello, Ill., October 57, 1983,
pp. 471480.

G.T. Toussaint, "An optimal
algorithm for computing the minimum vertex distance between two crossing
convex polygons," Proceedings of the Allerton Conference,
Monticello, Ill., October 57, 1983, 457458.

G.T. Toussaint, "Solving
geometric problems with the rotating calipers, " Proceedings
of IEEE MELECON' 83, Athens, Greece, May 1983.
1982

Godfried T. Toussaint, "Complexity,
convexity, and unimodality," Proceedings of the 2nd World Conference
on Mathematics at the Service of Man, Universidad Politecnica de Las
Palmas, Las Palmas, (Canary Islands) Spain, June 28  July 3, 1982, pp.
641648.
1981

J.R. Sack and G.T. Toussaint, "A
lineartime algorithm for decomposing rectilinear starshaped polygons
into convex quadrilaterals," Proc. Allerton Conference, Urbana,
October 1981, pp. 2130.

G.T. Toussaint and B.K. Bhattacharya, "Optimal
algorithms for computing the minimum distance between two finite planar
sets," Proc. Fifth International Congress of Cybernetics and
Systems, Mexico City, August, 1981.
1980

G.T. Toussaint, "Pattern
recognition and geometrical complexity," Proc. Fifth International
Conf. on Pattern Recognition, Miami Beach, December 1980, pp. 13241347.

G.T. Toussaint, "Decomposing
a simple polygon with the relative neighborhood graph," Proc.
of the Allerton Conference, October 1980, pp. 2028.

Godfried T. Toussaint and Robert Menard, "Fast algorithms
for computing the planar relative neighborhood graph," in Methods
of Operations Research, Proceedings of the Fifth Symposium on Operations
Research, University of Koln, August 1980, pp. 425428.
1979

G.T. Toussaint and R. S. Poulsen, "Some
new algorithms and software implementation methods for pattern recognition
research," Proc. IEEE Computer Society Third International Computer
Software and Applications Conference (COMPSAC'79), Nov. 68, 1979,
pp. 5563.

R.S. Poulsen, K.G. Marshall, L.H. Oliver, R.L.
Cahn, C. Louis, and G.T. Toussaint, " Highlighting
of progress by research groups in cytology automation: McGill University,"
Proc.
2nd Int. Conf. on the Automation of Cancer Cytology and Cell Image Analysis,
1979, Eds., N. J. Pressman and G. L. Wied, Chicago, pp. 107112.

R.S. Poulsen, L.H. Oliver, G. T. Toussaint and C. Louis, " Recent
progress in pattern recognition of cervical cell images at McGill University,"
Proc. of the 1979 International Conference on Pattern Recognition ofCell
Images, Chicago, May 2123, 1979.

1978

Selim G. Akl and Godfried T. Toussaint, "Efficient
convex hull algorithms for pattern recognition applications," Proceedings
of the Fourth International Joint Conference on Pattern Recognition,
Kyoto, Japan, November 710, 1978, pp. 483488.

G.T. Toussaint, "The convex
hull as a tool in pattern recognition," invited paper, Proceedings
AFOSR Workshop in Communication Theory and Applications, Provincetown,
Mass., Sept. 1978, pp. 4346.

S.G. Akl and G.T. Toussaint, "An
improved algorithm to check for polygon similarity," Proceedings
IEEE Computer Society Conference on Pattern Recognition and Image Processing,
Chicago, June 1978, pp. 3941.

G.T. Toussaint and R. Shinghal, "Cluster
analysis of English text," Proceedings IEEE Computer Society
Conference on Pattern Recognition and Image Processing, Chicago, June
1978, pp.164 172.

L. Oliver, R. Poulsen, and G.T. Toussaint, "Classification
of atypical cells in the automatic cytoscreening for cervical cancer,"
Proceedings IEEE Computer Society Conference on Pattern Recognition
and Image Processing, Chicago, May 31  June 2, 1978, pp. 476482.

Rajjan Shinghal and Godfried T. Toussaint, "Experiments
in textrecognition with the modified Viterbi algorithm," Proceedings
IEEE Computer Society Workshop on Pattern Recognition and Artificial Intelligence,
Princeton University, New Jersey, April 1214, 1978, (summary) pp. 4548.

1977

R. Shinghal, D. Rosenberg, and G.T. Toussaint,
"A simplified heuristic version of Raviv's algorithm
for using context in text recognition," Proc. of the International
Joint Conf. on Artificial Intelligence, Boston, Mass., August 1977,
pp. 179180.

G.T. Toussaint, "The use
of context in pattern recognition," Invited Address, Proc. IEEE
Conf. on Pattern Recognition and Image Processing, June 1977, Troy,
N.Y., pp. 110.

G.T. Toussaint, "Probability
of error, expected divergence, and the affinity of several distributions,"
Proc.
IEEE Conference on Pattern Recognition and Image Processing, June 1977,
Troy, N.Y., pp. 299303.

1976

J. Koplowitz and G.T. Toussaint, "A
unified theory of coding schemes for the efficient transmission of line
drawings," Proc. of 1976, IEEE Conf. on Communications and Power,
Montreal, October 1976, pp. 205208.
1974

G.T. Toussaint, "On information
transmission, nonparametric classification, and measuring dependence between
random variables," Proceedings of the Symposium on Statistics
and Related Topics, Carleton University, October 1974, pp. 30.0130.08.

G.T. Toussaint, "On the
affinity of several distributions for signal selection in communication
theory," Proceedings of the IEEE Canadian Conference on Communications
and Power, November 78, 1974, Montreal, Canada, pp. 6162.

G.T. Toussaint, "On some
measures of information and their application to pattern recognition,"
invited address, Proc. of Conf. on Measures of Information and their
Applications, Indian Institute of Technology, Bombay, India, August
1617, 1974, pp. 2128.

G.T. Toussaint, "Recent
progress in statistical methods applied to pattern recognition,"
invited address, Proc. Second International Joint Conf. on Pattern Recognition,
Copenhagen, Denmark, 1974.

G.T. Toussaint, "On the
divergence between two distributions and the probability of misclassification
of several decision rules," Proc. Second International Joint
Conf. on Pattern Recognition, August 1315, 1974, Copenhagen, Denmark,
pp. 2735.

1972

G.T. Toussaint, "Feature
evaluation with a proposed generalization of Kolmogorov's variational distance
and the Bhattacharyya coefficient," Proc. Annual Canadian Computer
Conference, Session 1972, Montreal, June 13, pp. 422401422413.

G.T. Toussaint and R.W. Donaldson, "Some
simple contextual decoding algorithms applied to recognition of hand printed
text," Proc. Annual Canadian Computer Conference, Session 1972,
Montreal, June 13, pp. 422101422115.

G.T. Toussaint, "A certainty
measure for feature evaluation in pattern recognition,"
Proceedings
of the Fifth Hawaii International Conference on Systems Sciences, January
1972, pp. 3739.