Godfried T. Toussaint

Gill Barequet, Nadia Benbernou, David Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz, Diane L. Souvaine, Godfried T. Toussaint, Andrew Winslow: Bounded-degree polyhedronization of point sets. Comput. Geom. 46(2): 148-153 (2013)

Godfried T. Toussaint, Constantin Berzan: Proximity-Graph Instance-Based Learning, Support Vector Machines, and High Dimensionality: An Empirical Comparison. MLDM 2012: 222-236

Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint: Computing Signed Permutations of Polygons. Int. J. Comput. Geometry Appl. 21(1): 87-100 (2011)

David Rappaport, Godfried T. Toussaint, Mustafa Mohamad: Minimum Many to Many Matchings for Computing the Distance Between Two Sequences. CCCG 2011

Csaba D. Tóth, Godfried T. Toussaint, Andrew Winslow: Open Guard Edges and Edge Guards in Simple Polygons. CCCG 2011

Giovanni Viglietta, Nadia Benbernou, Erik D. Demaine, Martin L. Demaine, Anastasia Kurdia, Joseph O'Rourke, Godfried T. Toussaint, Jorge Urrutia: Edge-guarding Orthogonal Polyhedra. CCCG 2011

Godfried T. Toussaint: Computational geometric aspects of rhythm, melody, and voice-leading. Comput. Geom. 43(1): 2-22 (2010)

Gill Barequet, Nadia Benbernou, David Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz, Diane L. Souvaine, Godfried T. Toussaint, Andrew Winslow: Bounded-degree polyhedronization of point sets. CCCG 2010: 99-102

Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood: The distance geometry of music. Comput. Geom. 42(5): 429-454 (2009)

Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint: Edge-unfolding nested polyhedral bands. Comput. Geom. 39(1): 30-42 (2008)

Pankaj K. Agarwal, Ferran Hurtado, Godfried T. Toussaint, Joan Trias: On polyhedra induced by point sets in space. Discrete Applied Mathematics 156(1): 42-54 (2008)

Eric Thul, Godfried T. Toussaint: Analysis of musical rhythm complexity measures in a cultural context. C3S2E 2008: 1-9

Francisco Gomez-Martin, Perouz Taslakian, Godfried T. Toussaint: Evenness preserving operations on musical rhythms. C3S2E 2008: 121-123

Eric Thul, Godfried T. Toussaint: On the relation between rhythm complexity measures and human rhythmic performance. C3S2E 2008: 199-204

Joseph O'Rourke, Perouz Taslakian, Godfried T. Toussaint: A Pumping Lemma for Homometric Rhythms. CCCG 2008

Eric Thul, Godfried T. Toussaint: Rhythm Complexity Measures: A Comparison of Mathematical Models of Human Perception and Performance. ISMIR 2008: 663-668

Zachary Abel, David Charlton, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Stefan Langerman, Joseph O'Rourke, Val Pinciu, Godfried T. Toussaint: Cauchy's Arm Lemma on a Growing Sphere. CoRR abs/0804.0986 (2008)

Justin Colannino, Godfried T. Toussaint: Corrigendum to "An algorithm for computing the restriction Scaffold assignment problem in computational biology" [Inform Process Lett 95 (4) (2005) 466-471]. Inf. Process. Lett. 103(1): 44 (2007)

Greg Aloupis, Brad Ballinger, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Y. Flatland, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Perouz Taslakian, Godfried T. Toussaint: Vertex Pops and Popturns. CCCG 2007: 137-140

Erik D. Demaine, Martin L. Demaine, Thomas Fevens, Antonio Mesa, Michael A. Soss, Diane L. Souvaine, Perouz Taslakian, Godfried T. Toussaint: Deflating the Pentagon. KyotoCGGT 2007: 56-67

Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood: The Distance Geometry of Music. CoRR abs/0705.4085 (2007)

Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Núñez Rodríguez, David Rappaport, Godfried T. Toussaint: Algorithms for Computing Geometric Measures of Melodic Similarity. Computer Music Journal 30(3): 67-76 (2006)

Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, Godfried T. Toussaint: An O(n log n)-Time Algorithm for the Restriction Scaffold Assignment Problem. Journal of Computational Biology 13(4): 979-989 (2006)

Mirela Damian, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Dania El-Khechen, Robin Y. Flatland, John Iacono, Stefan Langerman, Henk Meijer, Suneeta Ramaswami, Diane L. Souvaine, Perouz Taslakian, Godfried T. Toussaint: Curves in the Sand: Algorithmic Drawing. CCCG 2006

Erik D. Demaine, Blaise Gassend, Joseph O'Rourke, Godfried T. Toussaint: Polygons Flip Finitely: Flaws and a Fix. CCCG 2006

Godfried T. Toussaint: The Erdös-Nagy theorem and its ramifications . Comput. Geom. 31(3): 219-236 (2005)

David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint: Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. Discrete & Computational Geometry 33(4): 593-604 (2005)

Godfried T. Toussaint: Geometric proximity graphs for improving nearest neighbor methods in instance-based learning and data mining. Int. J. Comput. Geometry Appl. 15(2): 101-150 (2005)

Justin Colannino, Godfried T. Toussaint: An algorithm for computing the restriction scaffold assignment problem in computational biology. Inf. Process. Lett. 95(4): 466-471 (2005)

Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood: The Distance Geometry of Deep Rhythms and Scales. CCCG 2005: 163-166

Godfried T. Toussaint: Mathematical Features for Recognizing Preference in Sub-saharan African Traditional Rhythm Timelines. ICAPR (1) 2005: 18-27

Binay K. Bhattacharya, Kaustav Mukherjee, Godfried T. Toussaint: Geometric Decision Rules for Instance-Based Learning Problems. PReMI 2005: 60-69

Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, Godfried T. Toussaint: An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment. CoRR abs/cs/0507013 (2005)

Benjamin M. Marlin, Godfried T. Toussaint: Constructing convex 3-polytopes from two triangulations of a polygon. Comput. Geom. 28(1): 41-47 (2004)

Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint: Space-efficient planar convex hull algorithms. Theor. Comput. Sci. 321(1): 25-40 (2004)

Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint: Unfolding polyhedral bands. CCCG 2004: 60-63

Godfried T. Toussaint: A Comparison of Rhythmic Similarity Measures. ISMIR 2004

Godfried T. Toussaint: The Geometry of Musical Rhythm. JCDCG 2004: 198-212

Greg Aloupis, Stefan Langerman, Michael A. Soss, Godfried T. Toussaint: Algorithms for bivariate medians and a Fermat-Torricelli problem for lines. Comput. Geom. 26(1): 69-79 (2003)

Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, David Rappaport, Godfried T. Toussaint: Computing the Similarity of two Melodies. CCCG 2003: 81-84

Ferran Hurtado, Godfried T. Toussaint, Joan Trias: On Polyhedra Induced by Point Sets in Space. CCCG 2003: 107-110

Godfried T. Toussaint: Geometric Graphs for Improving Nearest Neighbor Decision Rules. ICCSA (3) 2003: 762-765

David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint: Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. WADS 2003: 451-461

Prosenjit Bose, Ferran Hurtado, Elsa Omaña-Pulido, Jack Snoeyink, Godfried T. Toussaint: Some Aperture-Angle Optimization Problems. Algorithmica 33(4): 411-435 (2002)

Prosenjit Bose, Suneeta Ramaswami, Godfried T. Toussaint, Alain Turki: Experimental results on quadrangulations of sets of fixed points. Computer Aided Geometric Design 19(7): 533-552 (2002)

Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides: A note on reconfiguring tree linkages: trees can lock. Discrete Applied Mathematics 117(1-3): 293-297 (2002)

Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristan, Thomas C. Shermer, Godfried T. Toussaint: Finding Specified Sections of Arrangements: 2D Results. J. Math. Model. Algorithms 1(1): 3-16 (2002)

Francisco Gómez, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristan, Godfried T. Toussaint: Implicit Convex Polygons. J. Math. Model. Algorithms 1(1): 57-85 (2002)

Elsa Omaña-Pulido, Godfried T. Toussaint: Aperture-Angle Optimization Problems in Three Dimensions. J. Math. Model. Algorithms 1(4): 301-329 (2002)

Greg Aloupis, Erik D. Demaine, Henk Meijer, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint: On flat-state connectivity of chains with fixed acute angles. CCCG 2002: 27-30

Benjamin M. Marlin, Godfried T. Toussaint: Constructing convex 3-polytopes from two triangulations of a polygon. CCCG 2002: 36-39

Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint: Computing signed permutations of polygons. CCCG 2002: 68-71

Greg Aloupis, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Stefan Langerman, Henk Meijer, Joseph O'Rourke, Mark H. Overmars, Michael A. Soss, Ileana Streinu, Godfried T. Toussaint: Flat-State Connectivity of Linkages under Dihedral Motions. ISAAC 2002: 369-380

Godfried T. Toussaint: Open Problems in Geometric Methods for Instance-Based Learning. JCDCG 2002: 273-283

Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint: In-Place Planar Convex Hull Algorithms. LATIN 2002: 494-507

Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint: Reconfiguring convex polygons. Comput. Geom. 20(1-2): 85-95 (2001)

Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides: Locked and Unlocked Polygonal Chains in Three Dimensions. Discrete & Computational Geometry 26(3): 269-281 (2001)

Prosenjit Bose, Michael E. Houle, Godfried T. Toussaint: Every Set of Disjoint Line Segments Admits a Binary Tree. Discrete & Computational Geometry 26(3): 387-410 (2001)

Jorge Alberto Calvo, Danny Krizanc, Pat Morin, Michael A. Soss, Godfried T. Toussaint: Convexifying polygons with simple projections. Inf. Process. Lett. 80(2): 81-86 (2001)

Greg Aloupis, Stefan Langerman, Michael A. Soss, Godfried T. Toussaint: Algorithms for bivariate medians and a fermat-torricelli problem for lines. CCCG 2001: 21-24

Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint: Reconfiguring Convex Polygons. CCCG 2000

Oswin Aichholzer, Carmen Cortés, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Henk Meijer, Mark H. Overmars, Belén Palop, Suneeta Ramaswami, Godfried T. Toussaint: Flipturning polygons. CoRR cs.CG/0008010 (2000)

Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint: Computing a Shortest Weakly Externally Visible Line Segment for a Simple Polygon. Int. J. Comput. Geometry Appl. 9(1): 81-96 (1999)

Godfried T. Toussaint: The Erdös-Nagy theorem and its ramifications. CCCG 1999

Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides: Locked and Unlocked Polygonal Chains in 3D. SODA 1999: 866-867

Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides: Locked and Unlocked Polygonal Chains in 3D. CoRR cs.CG/9910009 (1999)

Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides: On Reconfiguring Tree Linkages: Trees can Lock. CoRR cs.CG/9910024 (1999)

Prosenjit Bose, Marc J. van Kreveld, Godfried T. Toussaint: Filling polyhedral molds. Computer-Aided Design 30(4): 245-254 (1998)

Suneeta Ramaswami, Pedro A. Ramos, Godfried T. Toussaint: Converting triangulations to quadrangulations. Comput. Geom. 9(4): 257-276 (1998)

Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides: On reconfiguring tree linkages: Trees can lock. CCCG 1998

Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Godfried T. Toussaint: Hiding disks in folded polygons. CCCG 1998

Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristan, Thomas C. Shermer, Godfried T. Toussaint: Finding specified sections of arrangements: 2d results. CCCG 1998

Francisco Gómez, Ferran Hurtado, Joan Antoni Sellarès, Godfried T. Toussaint: Perspective projections and removal of degeneracies. CCCG 1998

Ferran Hurtado, Vera Sacristan, Godfried T. Toussaint: Constrainted facility location. CCCG 1998

Elsa Omaña-Pulido, Godfried T. Toussaint: Aperture-angle optimization problems in 3 dimensions. CCCG 1998

Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides: Locked and Unlocked Polygonal Chains in 3D. CoRR cs.CG/9811019 (1998)

Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose, Jesus Garcia-Lopez, Mark H. Overmars, Godfried T. Toussaint, Gordon T. Wilfong, Binhai Zhu: Feasibility of Design in Stereolithography. Algorithmica 19(1/2): 61-83 (1997)

Prosenjit Bose, Godfried T. Toussaint: Characterizing and efficiently computing quadrangulations of planar point sets. Computer Aided Geometric Design 14(8): 763-785 (1997)

Prosenjit Bose, Thomas C. Shermer, Godfried T. Toussaint, Binhai Zhu: Guarding Polyhedral Terrains. Comput. Geom. 7: 173-185 (1997)

Francisco Gómez, Suneeta Ramaswami, Godfried T. Toussaint: On Removing Non-degeneracy Assumptions in Computational Geometry. CIAC 1997: 86-99

Prosenjit Bose, David Bremner, Godfried T. Toussaint: All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers. Comput. Geom. 6: 291-302 (1996)

David Eu, Eric Guévremont, Godfried T. Toussaint: On Envelopes of Arrangements of Lines. J. Algorithms 21(1): 111-148 (1996)

Prosenjit Bose, Godfried T. Toussaint: Computing the Constrained Euclidean Geodesic and Link Center of a Simple Polygon with Application. Computer Graphics International 1996: 102-110

David Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink: On the Sectional Area of Convex Polytopes. Symposium on Computational Geometry 1996: C-11-C-12

Prosenjit Bose, Godfried T. Toussaint: Geometric and computational aspects of gravity casting. Computer-Aided Design 27(6): 455-464 (1995)

Prosenjit Bose, Godfried T. Toussaint: Growing a Tree from Its Branches. J. Algorithms 19(1): 86-103 (1995)

Prosenjit Bose, Francisco Gómez, Pedro A. Ramos, Godfried T. Toussaint: Drawing Nice Projections of Objects in Space. Graph Drawing 1995: 52-63

Prosenjit Bose, Godfried T. Toussaint: No Quadrangulation is Extremely Odd. ISAAC 1995: 372-381

Godfried T. Toussaint: Quadrangulations of Planar Sets. WADS 1995: 218-227

Prosenjit Bose, Godfried T. Toussaint: Geometric and computational aspects of manufacturing processes. Computers & Graphics 18(4): 487-497 (1994)

Jean-Marc Robert, Godfried T. Toussaint: Linear Approximation of Simple Objects. Comput. Geom. 4: 27-52 (1994)

David Eu, Godfried T. Toussaint: On Approximating Polygonal Curves in Two and Three Dimensions. CVGIP: Graphical Model and Image Processing 56(3): 231-246 (1994)

Chuzo Iwamoto, Godfried T. Toussaint: Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-Complete. Inf. Process. Lett. 52(4): 183-189 (1994)

Godfried T. Toussaint: A counterexample to Tomek's consistency theorem for a condensed nearest neighbor decision rule. Pattern Recognition Letters 15(8): 797-801 (1994)

Chuzo Iwamoto, Godfried T. Toussaint: Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-complete. CCCG 1994: 93-98

Prosenjit Bose, David Bremner, Godfried T. Toussaint: All Convex Polyhedra can be Clamped with Parallel Jaw Grippers. CCCG 1994: 344-349

Prosenjit Bose, Michael E. Houle, Godfried T. Toussaint: Every Set of Disjoint Line Segments Admits a Binary Tree. ISAAC 1994: 20-28

Luc Devroye, Godfried T. Toussaint: Convex Hulls for Random Lines. J. Algorithms 14(3): 381-394 (1993)

Hossam A. ElGindy, Hazel Everett, Godfried T. Toussaint: Slicing an ear using prune-and-search. Pattern Recognition Letters 14(9): 719-722 (1993)

Godfried T. Toussaint, Clark Verbrugge, Cao An Wang, Binhai Zhu: Tetrahedralization of Simple and Non-Simple Polyhedra. CCCG 1993: 24-29

Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose, Jesus Garcia-Lopez, Mark H. Overmars, Godfried T. Toussaint, Gordon T. Wilfong, Binhai Zhu: Feasability of Design in Stereolithography. FSTTCS 1993: 228-237

Prosenjit Bose, Marc J. van Kreveld, Godfried T. Toussaint: Filling Polyhedral Molds. WADS 1993: 210-221

Binay K. Bhattacharya, Jirel Czyzowicz, Peter Egyed, Godfried T. Toussaint, Ivan Stojmenovic, Jorge Urrutia: Computing shortest transversals of sets. Int. J. Comput. Geometry Appl. 2(4): 417-442 (1992)

Jean-Marc Robert, Godfried T. Toussaint: Linear Approximation of Simple Objects. STACS 1992: 233-244

Godfried T. Toussaint: A counter-example to a convex hull algorithm for polygons. Pattern Recognition 24(2): 183-184 (1991)

Binay K. Bhattacharya, Hazel Everett, Godfried T. Toussaint: A counterexample to a dynamic algorithm for convex hulls of line arrangements. Pattern Recognition Letters 12(3): 145-147 (1991)

Godfried T. Toussaint: Efficient triangulation of simple polygons. The Visual Computer 7(5&6): 280-295 (1991)

Binay K. Bhattacharya, Jurek Czyzowicz, Peter Egyed, Ivan Stojmenovic, Godfried T. Toussaint, Jorge Urrutia: Computing Shortest Transversals of Sets (Extended Abstract). Symposium on Computational Geometry 1991: 71-80

Binay K. Bhattacharya, Godfried T. Toussaint: Computing Shortest Transversals. ICALP 1991: 649-660

Jirel Czyzowicz, Peter Egyed, Hazel Everett, David Rappaport, Thomas C. Shermer, Diane L. Souvaine, Godfried T. Toussaint, Jorge Urrutia: The Aquarium Keeper's Problem. SODA 1991: 459-464

Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint: A Linear Time Algorithm for Computing the Shortest Line Segment from Which a Polygon is Weakly Externally Visible. WADS 1991: 412-424

David Rappaport, Hiroshi Imai, Godfried T. Toussaint: Computing Simple Circuits form a Set of Line Segments. Discrete & Computational Geometry 5: 289-304 (1990)

Xianshu Kong, Hazel Everett, Godfried T. Toussaint: The Graham scan triangulates simple polygons. Pattern Recognition Letters 11(11): 713-716 (1990)

Godfried T. Toussaint: On Seperating Two Simple Polygons by a Single Translation. Discrete & Computational Geometry 4: 265-278 (1989)

Hossam A. ElGindy, Godfried T. Toussaint: On geodesic properties of polygons relevant to linear time triangulation. The Visual Computer 5(1&2): 68-74 (1989)

Binay K. Bhattacharya, David G. Kirkpatrick, Godfried T. Toussaint: Determining Sector Visibility of a Polygon. Symposium on Computational Geometry 1989: 247-253

William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap: Computing the Link Center of a Simple Polygon. Discrete & Computational Geometry 3: 281-293 (1988)

Michael E. Houle, Godfried T. Toussaint: Computing the Width of a Set. IEEE Trans. Pattern Anal. Mach. Intell. 10(5): 761-765 (1988)

Binay K. Bhattacharya, Godfried T. Toussaint: Fast algorithms for computing the diameter of a finite planar set. The Visual Computer 3(6): 379-388 (1988)

Godfried T. Toussaint: Bayes classification rule for the general discrete case. Pattern Recognition 20(4): 411 (1987)

William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap: Computing the Link Center of a Simple Polygon. Symposium on Computational Geometry 1987: 1-10

David Avis, Teren Gum, Godfried T. Toussaint: Visibility between two edges of a simple polygon. The Visual Computer 2(6): 342-357 (1986)

David Rappaport, Hiroshi Imai, Godfried T. Toussaint: On Computing Simple Circuits on a Set of Line Segments. Symposium on Computational Geometry 1986: 52-60

Godfried T. Toussaint: Shortest Path Solves Translation Separability of Polygons. IAS 1986: 590-600

Godfried T. Toussaint: A simple linear algorithm for intersecting convex polygons. The Visual Computer 1(2): 118-123 (1985)

Michael E. Houle, Godfried T. Toussaint: Computating the width of a set. Symposium on Computational Geometry 1985: 1-7

Hossam A. ElGindy, Godfried T. Toussaint: On Computing and Updating Triangulations. FODO 1985: 249-262

Jörg-Rüdiger Sack, Godfried T. Toussaint: Translating Polygons in the Plane. STACS 1985: 310-321

Godfried T. Toussaint: Complexity, convexity, and unimodality. International Journal of Parallel Programming 13(3): 197-217 (1984)

Hossam A. ElGindy, David Avis, Godfried T. Toussaint: Applications of a two-dimensional hidden-line algorithm to other geometric problems. Computing 31(3): 191-202 (1983)

Godfried T. Toussaint: Computing largest empty circles with location constraints. International Journal of Parallel Programming 12(5): 347-358 (1983)

Binay K. Bhattacharya, Godfried T. Toussaint: Time- and storage-efficient implementation of an optimal planar convex hull algorithm. Image Vision Comput. 1(3): 140-144 (1983)

Binay K. Bhattacharya, Godfried T. Toussaint: Efficient Algorithms for Computing the Maximum Distance Between Two Finite Planar Sets. J. Algorithms 4(2): 121-136 (1983)

Godfried T. Toussaint: Review of 'Progress in Pattern Recognition' (Kanal, L.N., and Rosenfeld, A., Eds.; 1981). IEEE Transactions on Information Theory 29(5): 779-780 (1983)

Binay K. Bhattacharya, Godfried T. Toussaint: A Counterexample to a Diameter Algorithm for Convex Polygons. IEEE Trans. Pattern Anal. Mach. Intell. 4(3): 306-309 (1982)

Godfried T. Toussaint, David Avis: On a convex hull algorithm for polygons and its application to triangulation problems. Pattern Recognition 15(1): 23-29 (1982)

David Avis, Godfried T. Toussaint: An efficient algorithm for decomposing a polygon into star-shaped polygons. Pattern Recognition 13(6): 395-398 (1981)

David Avis, Godfried T. Toussaint: An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge. IEEE Trans. Computers 30(12): 910-914 (1981)

Godfried T. Toussaint: The relative neighbourhood graph of a finite planar set. Pattern Recognition 12(4): 261-268 (1980)

L. H. Oliver, Ronald S. Poulsen, Godfried T. Toussaint, C. Louis: Classification of atypical cells in the automatic cytoscreening for cervical cancer. Pattern Recognition 11(3): 205-212 (1979)

Selim G. Akl, Godfried T. Toussaint: An Improved Algorithm to Check for Polygon Similarity. Inf. Process. Lett. 7(3): 127-128 (1978)

Selim G. Akl, Godfried T. Toussaint: A Fast Convex Hull Algorithm. Inf. Process. Lett. 7(5): 219-222 (1978)

Godfried T. Toussaint: The use of context in pattern recognition. Pattern Recognition 10(3): 189-204 (1978)

Melvin Cohen, Godfried T. Toussaint: On the detection of structures in noisy pictures. Pattern Recognition 9(2): 95-98 (1977)

R. Schinghal, D. Rosenberg, Godfried T. Toussaint: A Simplified Heuristic Version of Raviv's Algorithm for Using Context in Text Recognition. IJCAI 1977: 179-180

Godfried T. Toussaint: Subjective clustering and bibliography of books on pattern recognition. Inf. Sci. 8(3): 251-257 (1975)

Godfried T. Toussaint: Comments on ``On a New Class of Bounds on Bayes' Risk in Multihypothesis Pattern Recognition''. IEEE Trans. Computers 24(8): 855-856 (1975)

Godfried T. Toussaint: Feature Evaluation with Quadratic Mutual Information. Inf. Process. Lett. 1(4): 153-156 (1972)

Godfried T. Toussaint: On a Simple Minkowski Metric Classifier. IEEE Trans. Systems Science and Cybernetics 6(4): 360-362 (1970)