Papers in Conference Proceedings

"Seventy percent of success in life is showing up." - Woody Allen

    2006

    1. 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 14-16, 2006.
    2. Mirela Damian, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Dania El-Khechen, 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 14-16, 2006.
    3. 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 4-8, 2006.
    4. 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 4-8, 2006.
    5. 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 4-8, 2006.

    2005

  1. Binay Bhattacharya, Kaustav Mukherjee and Godfried Toussaint, "Geometric decision rules for instance-based learning algorithms," Proceedings Pattern Recognition and Machine Intelligence: First International, Conference, S. K. Pal et al., (Eds.): LNCS 3776, Kolkata, India, December, 20-22, 2005, pp. 60-69.
  2. Godfried Toussaint, "The geometry of musical rhythm," Proceedings of the Japan Conference on Discrete and Computational Geometry, J. Akiyama et al. (Eds.), LNCS 3742, Springer-Verlag, Berlin, Heidelberg, 2005, pp. 198-212.
  3. Godfried Toussaint, "Mathematical features for recognizing preference in Sub-Saharan African traditional rhythm timelines," 3rd International Conference on Advances in Pattern Recognition, University of Bath, Bath, United Kingdom, August 22-25, 2005, pp. 18-27.
  4. Erik Demaine, Francisco Gomez-Martin, 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 10-12, 2005, pp. 160-163.
  5. Justin Colannino and Godfried Toussaint, "Faster algorithms for computing distances between one-dimensional 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 27-29, 2005, pp. 189-198.
  6. 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. 47-56.
  7. 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. 73-84.
  8. 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 5-12, 2005 (invited paper).

    2004

  1. Perouz Taslakian and Godfried T. Toussaint, "Hamiltonian cycles in sparse vertex-adjacency duals," Abstracts of the 14th Annual Fall Workshop on Computational Geometry, Massachussetts Institute of Technology, November 19-20, 2004, pp. 30-31.
  2. Godfried T. Toussaint, "Computational geometric aspects of musical rhythm," Abstracts of the 14th Annual Fall Workshop on Computational Geometry, Massachussetts Institute of Technology, November 19-20, 2004, pp. 47-48.
  3. Jose-Miguel Diaz-Banez, 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).
  4. 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 9-11, 2004, pp. 60-63.
  5. 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 10-14, 2004, pp. 242-245.
  6. Miguel Diaz-Banez, 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. 61-70.

2003

    1. Godfried T. Toussaint, "Open problems in geometric methods for instance-based learning," in Discrete and Computational Geometry, Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Editors: Jin Akiyama and Mikio Kano, Spinger-Verlag, Berlin-Heidelberg, 2003, pp. 273-283.
    2. 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 11-13, 2003, pp. 81-84.
    3. 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 11-13, 2003, pp. 107-110.
    4. David Bremner, Erik Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, and Godfried Toussaint, "Output-sensitive algorithms for computing nearest-neighbour 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, Springer-Verlag, LNCS 2748, pp. 451-461, 2003.
    5. 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 23-27, 2003, pp. 25-36.
    6. 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 16-17, 2003, pp. 101-107.
    7. 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, Springer-Verlag, 2003, pp. 762-765.

2002

2001

2000

    1. 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 10-13, 2000, pp. 25-40.
    2. 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 22-25, 2000, Tokay University, Tokyo, pp. 107-108.
    3. 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 16-19, 2000, pp. 17-20.
    4. 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. 1-11.

1999

    1. Godfried T. Toussaint, "The Erdos-Nagy theorem and its ramifications," Proceedings of the 11th Canadian Conference on Computational Geometry, (extended abstract) Vancouver, Canada, August 16-18, 1999, pp. 9-12.
    2. Godfried T. Toussaint, "Computational polygonal entanglement theory," Proceedings of the VIII Encuentros de Geometria Computacional, Castellon, Spain, July 7-9, 1999, pp. 269-278.
    3. 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 ACM-SIAM Symposium on Discrete Algorithms, Baltimore, USA, January 17-19, 1999, pp. 866-867.

1998

    1. 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 10-12, 1998, pp. 4-5.
    2. 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 10-12, 1998, pp. 36-37.
    3. 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 10-12, 1998, pp. 20-21.
    4. 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 10-12, 1998, pp. 100-101.
    5. 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 10-12, 1998, pp. 24-25.
    6. E. Omana-Pulido and G. T. Toussaint, "Aperture-angle optimization problems in 3 dimensions," Proceedings of the 10th Canadian Conference on Computational Geometry, McGill University, Montreal, Canada, August 10-12, 1998, pp. 96-97.
    7. 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 17-19, 1998, pp. 163-176.
    8. 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 1-4, 1998, pp. 441-450.

1997

    1. 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 7-9, 1997, pp. 15-28.
    2. F. Gomez, S. Ramaswami and G. T. Toussaint, "On removing non-degeneracy assumptions in computational geometry," Proc. Italian Conference on Algorithms, March 12-14, 1997, Rome, Italy, pp. 52-63.

    1996

    1. 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 24-28, 1996, pp. 102-112.
    2. 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 26-28, 1996, pp. 19-32.
    3. 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 24-26, 1996, pp. C11-C12.

    1995

    1. 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. 4-6, 1995, pp. 372-381.
    2. 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. 52-63.
    3. G. T. Toussaint, "Quadrangulations of planar sets," Proc. 4th International Workshop on Algorithms and Data Structures (WADS'95), Kingston, Canada, August 16-18, 1995, pp. 218-227.
    4. S. Ramaswami, P. Ramos and G. T. Toussaint, "Converting triangulations to quadrangulations," Proc. 7th C anadian Conference on Computational Geometry, Quebec City, Canada, August 10-14, 1995, pp. 297-302.
    5. P. Bose, F. Hurtado-Diaz, E. Omana-Pulido and G. T. Toussaint, "Some aperture-angle optimization problems," Proc. 7th C anadian Conference on Computational Geometry, Quebec City, Canada, August 10-14, 1995, pp. 73-78.
    6. G. T. Toussaint, "Quadrangulations," Actas de Los VI Encuentros de Geometria Computacional, Universidad Politecnica de Catalunya, Barcelona, Spain, July 5-7, 1995, pp. 51-58.
    7. 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 5-7, 1995, pp. 102-108.
    8. E. P. Omaña-Pulido 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 5-7, 1995, pp. 257-262.

    1994

    1. C. Pateras and G. T. Toussaint, "Bamboo fields: A new proximity graph and its application to text-line orientation estimation in document analysis," Proc. Third Workshop on Proximity Graphs, Mississippi State University, Starkville, Mississippi, December 1-3, 1994, Eds., D. W. Dearholt and M. J. Lipman, pp. 73-120.
    2. P. Bose and G. T. Toussaint, "Proximity graphs on line segments," Proc. Third Workshop on Proximity Graphs, Mississippi State University, Starkville, Mississippi, December 1-3, 1994, Eds., D. W. Dearholt and M. J. Lipman, pp. 31-52.
    3. 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 25-27, 1994, pp. 20-28.
    4. 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 26-29, 1994, pp. 279-291.
    5. G. T. Toussaint, "Computing extremal sections of convex polyhedra," Proc. Sixth Australasian Workshop on Combinatorial Algorithms, Darwin, Australia, June 20-25, 1994, pp. 17-20.
    6. G. Blanco, H. Everett, J. Garcia-Lopez 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.
    7. P. Bose and J. T. Toussaint, "Geometric and computational aspects of manufacturing processes," Proc. International Conference on Computer Aided Geometric Design, July 4-8, 1994, Penang, Malaysia, pp.
    8. C. Iwamoto and G. T. Toussaint, "Finding Hamiltonian circuits in arrangements of Jordan curves is NP-complete," Proc. Sixth Canadian Conference on Computational Geometry, Saskatoon, Saskatchewan, August 2-6, 1994, pp. 93-98.
    9. 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 2-6, 1994, pp. 345-349.
    10. G. T. Toussaint, "Computational geometry for document analysis," Third Annual Symposium on Document Analysis and Information Retrieval, Alexis Park Hotel, Las Vegas, Nevada, April 11-13, 1994, pp. 23-42.

    1993

    1. B. Asberg, G. Blanco, P. Bose, J. Garcia-Lopez, 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 15-17, 1993, Springer-Verlag LNCS vol. 761, pp. 228-237.
    2. 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 30-September 11, 1993, Seoul, Korea, pp. 90-99.
    3. P. Bose and G. T. Toussaint, "Geometric and computational aspects of injection molding," Proc. Third International Conference on CAD and Computer Graphics, August 23-26, 1993, Beijing, China, pp. 237-242.
    4. P. Bose, M. van Kreveld and G. T. Toussaint, "Filling polyhedral molds," Proc. Third Workshop on Algorithms and Data Structures, August 11-13, 1993, Montreal, Canada, pp. 210-221.
    5. G. T. Toussaint, C. Verbrugge, C. Wang and B. Zhu, "Tetrahedralization of simple and non-simple polyhedra," Proc. Fifth Canadian Conference on Computational Geometry, August 5-9, 1993, University of Waterloo, Canada, pp. 24-29.
    6. G. Blanco, H. Everett, J. Garcia-Lopez 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. 27-35.
    7. P. Bose, F. Hurtado-Díaz, E. Omaña-Pulido 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. 37-44.

    1992

    1. D. Eu and G. T. Toussaint, "Polygonal approximation of curves," SPIE Conference on Vision Geometry, Boston, Mass., November 15-16, 1992.
    2. P. Bose, T. Shermer. G. T. Toussaint and B. Zhu, "Guarding polyhedral terrains," Proc. Allerton Conference, Urbana-Champaign, Illinois, October 1992.
    3. 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 13-16, 1992, pp. MM5.3.1-MM5.3.4.
    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 10-14, 1992, pp. 109-114.
    5. 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. 233-244.

    1991

    1. 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 11-14, 1991, pp. 1406-1411.
    2. B. K. Bhattacharya, A. Mukhopadhyay and G. T. Toussaint, "A linear-time 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 14-16, 1991, pp. 412-424.
    3. M. Keil and G. T. Toussaint, "Detecting and computing intersections of convex chains," Proc. Third Canadian Conference on Computational Geometry, Vancouver, August 6-10, 1991, pp. 7-10.
    4. B. Bhattacharya, P. Egyed and G. T. Toussaint, "Computing the wingspan of a butterfly," Proc. Third Canadian Conference on Computational Geometry, Vancouver, August 6-10, 1991, pp. 88-91.
    5. B. K. Bhattacharya and G. T. Toussaint, "Computing shortest transversals," Proc. ICALP '91, Madrid, Spain, July 8-12, 1991.
    6. 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 10-12, 1991, North Conway, New Hampshire, pp. 71-80.
    7. 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 28-30, 1991, pp. 459-464.
    8. Godfried T. Toussaint, "Computing geometrical and graph-theoretical properties of line arrangements," Proceedings of the 6th Caribbean Conference on Combinatorics and Computing, St. Augustine, Trinidad, West Indies, January 7-10, 1991, pp, 260-270.

      9.  

    1990

    1. 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. 11-15, 1990, pp. B-1 to B-19.
    2. 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 11-15, 1990.
    3. G. T. Toussaint, "An output-complexity-sensitive polygon triangulation algorithm," in Computer Graphics International'90, T. S. Chua & T. L. Kunii, (Eds.), Springer-Verlag, Singapore, June 26-30, 1990, pp. 443-466.

    1989

    1. 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. 188-192.
    2. Godfried T. Toussaint, "Computational geometry: Recent developments," Proceedings of the Seventh International Conference of the Computer Graphics Society, University of Leeds, United Kingdom, June 27-30, 1989, Rae A. Earnshaw and Brian Wyvill, Eds., Springer-Verlag, Tokyo, 1989, pp. 23-51.
    3. 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 5-7, 1989, Saarbrucken, Germany, pp. 247-253.
    4. 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 23-27, 1989, pp. 117-123.

    1988

    1. Godfried T. Toussaint and Hossam ElGindy, "Computing link-distance properties inside a simple polygon," Proceedings of the Fifth Caribbean Conference on Combinatorics and Computing, University of West Indies, Cave Hill, Barbados, January 4-8, 1988, pp. 156-167.
    2. Hossam ElGindy and Godfried T. Toussaint, "On triangulating palm polygons in linear time," Proceedings of Computer Graphics International'88, Geneva, Switzerland, May 24-27, 1988.
    3. 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 18-20, 1988, pp. 103-122.

      4.  

    1987

    1. 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 22-24, 1985, In Foundations of Data Organization, Editors: Sakti P. Ghosh, Yahiko Kambayashi and Katsumi Tanaka, Plenum Press, New York, 1987, pp. 249-262.
    2. 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. 89-104.
    3. 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, 365-374.
    4. 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 4-17, 1987, pp.639-672.
    5. 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 8-10, 1987, pp.1-10.

    1986

    1. Godfried T. Toussaint, "Shortest path solves translation separability of polygons," Intelligent Autonomous Systems: An International Conference, Elsevier Science Publishers, Amsterdam, The Netherlands, December 8-11, 1986, pp. 590-600.
    2. 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 EURASIP-86, Part 2, North-Holland, September 1986, pp. 853-856.
    3. 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 24-26, 1986, pp. 59-62.
    4. Minou Mansouri and Godfried T. Toussaint, "Translation queries for convex polygons," Proceedings of IASTED International Symposium on Robotics and Automation, Lugano, Switzerland, June 24-26, vol. 1, No. 3, 1986, pp.90-95.
    5. Tetsuo Asano and Godfried T. Toussaint, "Computing the geodesic center of a simple polygon," Proceedings of the Japan-US Joint Seminar on Discrete Algorithms and Complexity, Kyoto, Japan, June 4-6, 1986, pp. 65-80.

    1985

    1. G. T. Toussaint, "Computational geometry and morphology," First International Symposium for Science on Form, Tsukuba, Japan, November 26-30, 1985.
    2. G. T. Toussaint, "Some collision avoidance problems between spheres," Proc. International Conference on Systems, Man, and Cybernetics, Tucson, November 12-15, 1985.
    3. G. T. Toussaint, "Recent results in collision avoidance problems," Proceedings of COMPINT-85 (Computer Aided Technologies) , Montreal, September 8-12, 1985, pp. 194-197.
    4. 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 24-26, 1985, pp. 59-62.
    5. Minou Mansouri and Godfried T. Toussaint, "Translation queries for convex polygons," Proceedings of IASTED International Symposium on Robotics and Automation, Lugano, Switzerland, June 24-26, 1985, pp. 12-16.
    6. G. T. Toussaint, "New results in computational geometry relevant to pattern recognition in practice," Proc. Pattern Recognition in Practice-II, Amsterdam, June 19-21, 1985.
    7. M.E. Houle and G. T. Toussaint, "Computing the width of a set," Proc. Symposium on Computational Geometry, Baltimore, June 5-7, 1985, pp. 1-7.
    8. G. T. Toussaint and H. A. ElGindy, "Two monotone polygons can be separated in linear time," Proc. IPS/ACI CONGRES 85, Montreal, June 3-5, 1985.
    9. J. R. Sack and G. T. Toussaint, "Translating polygons in the plane," Proc. STACS'85, Lecture Notes in Computer Science #182, Springer-Verlag, Heidelberg, 1985, pp. 310-321.

    1984

    1. G. T. Toussaint, "An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons," Proc. Seventh International-Conference on Pattern Recognition, Montreal, July 30-August 2, 1984, pp. 465-467.
    2. H. A. ElGindy and G. T. Toussaint, "On triangulations of line segments," Proc. Int. AMSE Conf. Modelling and Simulation, Athens, Greece, June 27-29 1984, vol. 1.3, pp. 83-107.
    3. 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 14-16,1984, Published by North-Holland in 1985, Amsterdam, L. Billard, Ed., pp. 97-108.

    1983

    1. 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 18-19, 1983, pp. 158-163.
    2. G.T. Toussaint, "Computing largest empty circles with location constraints," Proceedings of the  Allerton Conference, Monticello, Ill., October 5-7, 1983, pp. 471-480.
    3. 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 5-7, 1983, 457-458.
    4. G.T. Toussaint, "Solving geometric problems with the rotating calipers, " Proceedings of IEEE MELECON' 83, Athens, Greece, May 1983.

    1982

    1. 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. 641-648.

    1981

    1. J.R. Sack and G.T. Toussaint, "A linear-time algorithm for decomposing rectilinear star-shaped polygons into convex quadrilaterals," Proc. Allerton Conference, Urbana, October 1981, pp. 21-30.
    2. 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

    1. G.T. Toussaint, "Pattern recognition and geometrical complexity," Proc. Fifth International Conf. on Pattern Recognition, Miami Beach, December 1980, pp. 1324-1347.
    2. G.T. Toussaint, "Decomposing a simple polygon with the relative neighborhood graph," Proc. of the Allerton Conference, October 1980, pp. 20-28.
    3. 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. 425-428.

    1979

    1. 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. 6-8, 1979, pp. 55-63.
    2. 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. 107-112.
    3. 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 21-23, 1979.

    1978

    1. 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 7-10, 1978, pp. 483-488.
    2. 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. 43-46.
    3. 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. 39-41.
    4. 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.
    5. 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. 476-482.
    6. Rajjan Shinghal and Godfried T. Toussaint, "Experiments in text-recognition with the modified Viterbi algorithm," Proceedings IEEE Computer Society Workshop on Pattern Recognition and Artificial Intelligence, Princeton University, New Jersey, April 12-14, 1978, (summary) pp. 45-48.

    1977

    1. 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. 179-180.
    2. 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. 1-10.
    3. 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. 299-303.

    1976

    1. 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. 205-208.

    1974

    1. 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.01-30.08.
    2. 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 7-8, 1974, Montreal, Canada, pp. 61-62.
    3. 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 16-17, 1974, pp. 21-28.
    4. 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.
    5. 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 13-15, 1974, Copenhagen, Denmark, pp. 27-35.

    1972

    1. 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 1-3, pp. 422401-422413.
    2. 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 1-3, pp. 422101-422115.
    3. 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. 37-39.