Godfried T. Toussaint

198 papers A* 4A 3B 10C 4Misc 1Journal 122Unranked 53

Year	Rank	Type	Title / Venue / Authors
2018	—	`conf`	On Measuring the Complexity of Musical Rhythm. UEMCON Godfried T. Toussaint, Konstantinos Trochidis
2015	—	`conf`	A Dissimilarity Measure for Comparing Origami Crease Patterns. ICPRAM (1) Seung Man Oh, Godfried T. Toussaint, Erik D. Demaine, Martin L. Demaine
2015	J	`jnl`	Measuring Musical Rhythm Similarity: Statistical Features Versus Transformation Methods. Int. J. Pattern Recognit. Artif. Intell. Juan Felipe Beltran, Xiaohua Liu, Nishant Mohanchandra, Godfried T. Toussaint
2015	Misc	`conf`	Measuring the complexity of two-dimensional binary patterns - Sub-symmetries versus Papentin complexity. MVA Godfried T. Toussaint, Noris S. Onea, Quan-Hoang Vuong
2014	—	`conf`	An Empirical Comparison of Support Vector Machines Versus Nearest Neighbour Methods for Machine Learning Applications. ICPRAM (Selected Papers) Moïri Gamboni, Abhijai Garg, Oleg Grishin, Seung Man Oh, Francis Sowani, Anthony Spalvieri-Kruse, Godfried T. Toussaint, Lingliang Zhang
2014	C	`conf`	Speeding up Support Vector Machines - Probabilistic versus Nearest Neighbour Methods for Condensing Training Data. ICPRAM Moïri Gamboni, Abhijai Garg, Oleg Grishin, Seung Man Oh, Francis Sowani, Anthony Spalvieri-Kruse, Godfried T. Toussaint, Lingliang Zhang
2013	J	`jnl`	Bounded-degree polyhedronization of point sets. Comput. Geom. Gill Barequet, Nadia M. Benbernou, David Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz, Diane L. Souvaine, Godfried T. Toussaint, Andrew Winslow
2013	—	`conf`	Measuring Irregularity in Symbolic Spike Trains: Application to Steve Reich's Clapping Music. ICDM (Workshops) Godfried T. Toussaint
2012	—	`conf`	Proximity-Graph Instance-Based Learning, Support Vector Machines, and High Dimensionality: An Empirical Comparison. MLDM Godfried T. Toussaint, Constantin Berzan
2011	J	`jnl`	Computing Signed Permutations of Polygons. Int. J. Comput. Geom. Appl. Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint
2011	—	`conf`	Edge-guarding Orthogonal Polyhedra. CCCG Giovanni Viglietta, Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anastasia Kurdia, Joseph O'Rourke, Godfried T. Toussaint, Jorge Urrutia
2011	—	`conf`	Minimum Many to Many Matchings for Computing the Distance Between Two Sequences. CCCG David Rappaport, Godfried T. Toussaint, Mustafa Mohamad
2011	—	`conf`	Open Guard Edges and Edge Guards in Simple Polygons. CCCG Csaba D. Tóth, Godfried T. Toussaint, Andrew Winslow
2011	—	`conf`	Open Guard Edges and Edge Guards in Simple Polygons. EGC Csaba D. Tóth, Godfried T. Toussaint, Andrew Winslow
2010	—	`conf`	Bounded-degree polyhedronization of point sets. CCCG Gill Barequet, Nadia M. Benbernou, David Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz, Diane L. Souvaine, Godfried T. Toussaint, Andrew Winslow
2010	J	`jnl`	Computational geometric aspects of rhythm, melody, and voice-leading. Comput. Geom. Godfried T. Toussaint
2009	J	`jnl`	The distance geometry of music. Comput. Geom. Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood
2008	—	`conf`	A Pumping Lemma for Homometric Rhythms. CCCG Joseph O'Rourke, Perouz Taslakian, Godfried T. Toussaint
2008	—	`conf`	Analysis of musical rhythm complexity measures in a cultural context. C3S2E Eric Thul, Godfried T. Toussaint
2008	J	`jnl`	Cauchy's Arm Lemma on a Growing Sphere CoRR Zachary Abel, David Charlton, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Stefan Langerman, Joseph O'Rourke, Val Pinciu, Godfried T. Toussaint
2008	J	`jnl`	Edge-unfolding nested polyhedral bands. Comput. Geom. Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint
2008	—	`conf`	Evenness preserving operations on musical rhythms. C3S2E Francisco Gomez-Martin, Perouz Taslakian, Godfried T. Toussaint
2008	J	`jnl`	On polyhedra induced by point sets in space. Discret. Appl. Math. Pankaj K. Agarwal, Ferran Hurtado, Godfried T. Toussaint, Joan Trias
2008	—	`conf`	On the relation between rhythm complexity measures and human rhythmic performance. C3S2E Eric Thul, Godfried T. Toussaint
2008	—	`conf`	Rhythm Complexity Measures: A Comparison of Mathematical Models of Human Perception and Performance. ISMIR Eric Thul, Godfried T. Toussaint
2007	J	`jnl`	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. Justin Colannino, Godfried T. Toussaint
2007	—	`conf`	Deflating the Pentagon. KyotoCGGT Erik D. Demaine, Martin L. Demaine, Thomas Fevens, Antonio Mesa, Michael A. Soss, Diane L. Souvaine, Perouz Taslakian, Godfried T. Toussaint
2007	J	`jnl`	The Distance Geometry of Music CoRR Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood
2007	—	`conf`	Vertex Pops and Popturns. CCCG 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
2006	J	`jnl`	Algorithms for Computing Geometric Measures of Melodic Similarity. Comput. Music. J. Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Núñez Rodríguez, David Rappaport, Godfried T. Toussaint
2006	J	`jnl`	An J. Comput. Biol. Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, Godfried T. Toussaint
2006	—	`conf`	Curves in the Sand: Algorithmic Drawing. CCCG 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
2006	—	`conf`	Polygons Flip Finitely: Flaws and a Fix. CCCG Erik D. Demaine, Blaise Gassend, Joseph O'Rourke, Godfried T. Toussaint
2005	J	`jnl`	An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment CoRR Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, Godfried T. Toussaint
2005	J	`jnl`	An algorithm for computing the restriction scaffold assignment problem in computational biology. Inf. Process. Lett. Justin Colannino, Godfried T. Toussaint
2005	—	`conf`	Geometric Decision Rules for Instance-Based Learning Problems. PReMI Binay K. Bhattacharya, Kaustav Mukherjee, Godfried T. Toussaint
2005	J	`jnl`	Geometric proximity graphs for improving nearest neighbor methods in instance-based learning and data mining. Int. J. Comput. Geom. Appl. Godfried T. Toussaint
2005	—	`conf`	Mathematical Features for Recognizing Preference in Sub-saharan African Traditional Rhythm Timelines. ICAPR (1) Godfried T. Toussaint
2005	J	`jnl`	Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. Discret. Comput. Geom. David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint
2005	—	`conf`	The Distance Geometry of Deep Rhythms and Scales. CCCG Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood
2005	J	`jnl`	The Erdös-Nagy theorem and its ramifications . Comput. Geom. Godfried T. Toussaint
2004	—	`conf`	A Comparison of Rhythmic Similarity Measures. ISMIR Godfried T. Toussaint
2004	J	`jnl`	Constructing convex 3-polytopes from two triangulations of a polygon. Comput. Geom. Benjamin M. Marlin, Godfried T. Toussaint
2004	—	`ch.`	Pattern recognition. Handbook of Discrete and Computational Geometry, 2nd Ed. Joseph O'Rourke, Godfried T. Toussaint
2004	J	`jnl`	Space-efficient planar convex hull algorithms. Theor. Comput. Sci. Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint
2004	—	`conf`	The Geometry of Musical Rhythm. JCDCG Godfried T. Toussaint
2004	—	`conf`	Unfolding polyhedral bands. CCCG Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint
2003	J	`jnl`	Algorithms for bivariate medians and a Fermat-Torricelli problem for lines. Comput. Geom. Greg Aloupis, Stefan Langerman, Michael A. Soss, Godfried T. Toussaint
2003	—	`conf`	Computing the Similarity of two Melodies. CCCG Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Núñez Rodríguez, David Rappaport, Godfried T. Toussaint
2003	—	`conf`	Geometric Graphs for Improving Nearest Neighbor Decision Rules. ICCSA (3) Godfried T. Toussaint
2003	—	`conf`	On Polyhedra Induced by Point Sets in Space. CCCG Ferran Hurtado, Godfried T. Toussaint, Joan Trias
2003	B	`conf`	Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. WADS David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint
2002	J	`jnl`	A note on reconfiguring tree linkages: trees can lock. Discret. Appl. Math. Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
2002	J	`jnl`	Aperture-Angle Optimization Problems in Three Dimensions. J. Math. Model. Algorithms Elsa Omaña-Pulido, Godfried T. Toussaint
2002	—	`conf`	Computing signed permutations of polygons. CCCG Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint
2002	—	`conf`	Constructing convex 3-polytopes from two triangulations of a polygon. CCCG Benjamin M. Marlin, Godfried T. Toussaint
2002	J	`jnl`	Experimental results on quadrangulations of sets of fixed points. Comput. Aided Geom. Des. Prosenjit Bose, Suneeta Ramaswami, Godfried T. Toussaint, Alain Turki
2002	J	`jnl`	Finding Specified Sections of Arrangements: 2D Results. J. Math. Model. Algorithms Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristán, Thomas C. Shermer, Godfried T. Toussaint
2002	B	`conf`	Flat-State Connectivity of Linkages under Dihedral Motions. ISAAC 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
2002	J	`jnl`	Flipturning Polygons. Discret. Comput. Geom. 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
2002	J	`jnl`	Implicit Convex Polygons. J. Math. Model. Algorithms Francisco Gómez, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristán, Godfried T. Toussaint
2002	B	`conf`	In-Place Planar Convex Hull Algorithms. LATIN Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint
2002	—	`conf`	On flat-state connectivity of chains with fixed acute angles. CCCG Greg Aloupis, Erik D. Demaine, Henk Meijer, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint
2002	—	`conf`	Open Problems in Geometric Methods for Instance-Based Learning. JCDCG Godfried T. Toussaint
2002	J	`jnl`	Some Aperture-Angle Optimization Problems. Algorithmica Prosenjit Bose, Ferran Hurtado, Elsa Omaña-Pulido, Jack Snoeyink, Godfried T. Toussaint
2001	—	`conf`	Algorithms for bivariate medians and a fermat-torricelli problem for lines. CCCG Greg Aloupis, Stefan Langerman, Michael A. Soss, Godfried T. Toussaint
2001	J	`jnl`	Convexifying polygons with simple projections. Inf. Process. Lett. Jorge Alberto Calvo, Danny Krizanc, Pat Morin, Michael A. Soss, Godfried T. Toussaint
2001	J	`jnl`	Every Set of Disjoint Line Segments Admits a Binary Tree. Discret. Comput. Geom. Prosenjit Bose, Michael E. Houle, Godfried T. Toussaint
2001	J	`jnl`	Locked and Unlocked Polygonal Chains in Three Dimensions. Discret. Comput. Geom. Therese 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
2001	J	`jnl`	Reconfiguring convex polygons. Comput. Geom. Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint
2000	J	`jnl`	Flipturning polygons CoRR 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
2000	—	`conf`	Reconfiguring Convex Polygons. CCCG Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint
1999	J	`jnl`	Computing a Shortest Weakly Externally Visible Line Segment for a Simple Polygon. Int. J. Comput. Geom. Appl. Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint
1999	J	`jnl`	Locked and Unlocked Polygonal Chains in 3D CoRR Therese 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
1999	A*	`conf`	Locked and Unlocked Polygonal Chains in 3D. SODA Therese 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
1999	J	`jnl`	On Reconfiguring Tree Linkages: Trees can Lock CoRR Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
1999	—	`conf`	The Erdös-Nagy theorem and its ramifications. CCCG Godfried T. Toussaint
1998	—	`conf`	Aperture-angle optimization problems in 3 dimensions. CCCG Elsa Omaña-Pulido, Godfried T. Toussaint
1998	—	`conf`	Constrainted facility location. CCCG Ferran Hurtado, Vera Sacristán, Godfried T. Toussaint
1998	J	`jnl`	Converting triangulations to quadrangulations. Comput. Geom. Suneeta Ramaswami, Pedro A. Ramos, Godfried T. Toussaint
1998	J	`jnl`	Filling polyhedral molds. Comput. Aided Des. Prosenjit Bose, Marc J. van Kreveld, Godfried T. Toussaint
1998	—	`conf`	Finding specified sections of arrangements: 2d results. CCCG Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristán, Thomas C. Shermer, Godfried T. Toussaint
1998	—	`conf`	Hiding disks in folded polygons. CCCG Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Godfried T. Toussaint
1998	J	`jnl`	Locked and Unlocked Polygonal Chains in 3D CoRR Therese 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
1998	—	`conf`	On reconfiguring tree linkages: Trees can lock. CCCG Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
1998	—	`conf`	Perspective projections and removal of degeneracies. CCCG Francisco Gómez, Ferran Hurtado, Joan Antoni Sellarès, Godfried T. Toussaint
1997	J	`jnl`	Characterizing and efficiently computing quadrangulations of planar point sets. Comput. Aided Geom. Des. Prosenjit Bose, Godfried T. Toussaint
1997	J	`jnl`	Feasibility of Design in Stereolithography. Algorithmica Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose, Jesus Garcia-Lopez, Mark H. Overmars, Godfried T. Toussaint, Gordon T. Wilfong, Binhai Zhu
1997	J	`jnl`	Guarding Polyhedral Terrains. Comput. Geom. Prosenjit Bose, Thomas C. Shermer, Godfried T. Toussaint, Binhai Zhu
1997	C	`conf`	On Removing Non-degeneracy Assumptions in Computational Geometry. CIAC Francisco Gómez, Suneeta Ramaswami, Godfried T. Toussaint
1996	J	`jnl`	All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers. Comput. Geom. Prosenjit Bose, David Bremner, Godfried T. Toussaint
1996	C	`conf`	Computing the Constrained Euclidean Geodesic and Link Center of a Simple Polygon with Application. Computer Graphics International Prosenjit Bose, Godfried T. Toussaint
1996	J	`jnl`	On Envelopes of Arrangements of Lines. J. Algorithms David Eu, Eric Guévremont, Godfried T. Toussaint
1996	—	`conf`	On the Sectional Area of Convex Polytopes. SCG David Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink
1995	—	`conf`	Aperture angle optimization problems. CCCG Prosenjit Bose, Ferran Hurtado, Elsa Omaña-Pulido, Godfried T. Toussaint
1995	A	`conf`	Drawing Nice Projections of Objects in Space. GD Prosenjit Bose, Francisco Gómez, Pedro A. Ramos, Godfried T. Toussaint
1995	J	`jnl`	Geometric and computational aspects of gravity casting. Comput. Aided Des. Prosenjit Bose, Godfried T. Toussaint
1995	J	`jnl`	Growing a Tree from Its Branches. J. Algorithms Prosenjit Bose, Godfried T. Toussaint
1995	B	`conf`	No Quadrangulation is Extremely Odd. ISAAC Prosenjit Bose, Godfried T. Toussaint
1995	B	`conf`	Quadrangulations of Planar Sets. WADS Godfried T. Toussaint
1994	J	`jnl`	A counterexample to Tomek's consistency theorem for a condensed nearest neighbor decision rule. Pattern Recognit. Lett. Godfried T. Toussaint
1994	—	`conf`	All Convex Polyhedra can be Clamped with Parallel Jaw Grippers. CCCG Prosenjit Bose, David Bremner, Godfried T. Toussaint
1994	B	`conf`	Every Set of Disjoint Line Segments Admits a Binary Tree. ISAAC Prosenjit Bose, Michael E. Houle, Godfried T. Toussaint
1994	J	`jnl`	Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-Complete. Inf. Process. Lett. Chuzo Iwamoto, Godfried T. Toussaint
1994	—	`conf`	Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-complete. CCCG Chuzo Iwamoto, Godfried T. Toussaint
1994	J	`jnl`	Geometric and computational aspects of manufacturing processes. Comput. Graph. Prosenjit Bose, Godfried T. Toussaint
1994	J	`jnl`	Linear Approximation of Simple Objects. Comput. Geom. Jean-Marc Robert, Godfried T. Toussaint
1994	J	`jnl`	On Approximating Polygonal Curves in Two and Three Dimensions. CVGIP Graph. Model. Image Process. David Eu, Godfried T. Toussaint
1993	J	`jnl`	Convex Hulls for Random Lines. J. Algorithms Luc Devroye, Godfried T. Toussaint
1993	—	`conf`	Feasability of Design in Stereolithography. FSTTCS Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose, Jesus Garcia-Lopez, Mark H. Overmars, Godfried T. Toussaint, Gordon T. Wilfong, Binhai Zhu
1993	B	`conf`	Filling Polyhedral Molds. WADS Prosenjit Bose, Marc J. van Kreveld, Godfried T. Toussaint
1993	J	`jnl`	Slicing an ear using prune-and-search. Pattern Recognit. Lett. Hossam A. ElGindy, Hazel Everett, Godfried T. Toussaint
1993	—	`conf`	Tetrahedralization of Simple and Non-Simple Polyhedra. CCCG Godfried T. Toussaint, Clark Verbrugge, Cao An Wang, Binhai Zhu
1992	J	`jnl`	Computing shortest transversals of sets. Int. J. Comput. Geom. Appl. Binay K. Bhattacharya, Jurek Czyzowicz, Peter Egyed, Godfried T. Toussaint, Ivan Stojmenovic, Jorge Urrutia
1992	A	`conf`	Linear Approximation of Simple Objects. STACS Jean-Marc Robert, Godfried T. Toussaint
1992	J	`jnl`	Relative neighborhood graphs and their relatives. Proc. IEEE Jerzy W. Jaromczyk, Godfried T. Toussaint
1991	B	`conf`	A Linear Time Algorithm for Computing the Shortest Line Segment from Which a Polygon is Weakly Externally Visible. WADS Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint
1991	J	`jnl`	A counter-example to a convex hull algorithm for polygons. Pattern Recognit. Godfried T. Toussaint
1991	J	`jnl`	A counterexample to a dynamic algorithm for convex hulls of line arrangements. Pattern Recognit. Lett. Binay K. Bhattacharya, Hazel Everett, Godfried T. Toussaint
1991	—	`conf`	Computing Shortest Transversals of Sets (Extended Abstract). SCG Binay K. Bhattacharya, Jurek Czyzowicz, Peter Egyed, Ivan Stojmenovic, Godfried T. Toussaint, Jorge Urrutia
1991	A*	`conf`	Computing Shortest Transversals. ICALP Binay K. Bhattacharya, Godfried T. Toussaint
1991	J	`jnl`	Efficient triangulation of simple polygons. Vis. Comput. Godfried T. Toussaint
1991	A*	`conf`	The Aquarium Keeper's Problem. SODA Jurek Czyzowicz, Peter Egyed, Hazel Everett, David Rappaport, Thomas C. Shermer, Diane L. Souvaine, Godfried T. Toussaint, Jorge Urrutia
1990	J	`jnl`	Computing Simple Circuits form a Set of Line Segments. Discret. Comput. Geom. David Rappaport, Hiroshi Imai, Godfried T. Toussaint
1990	J	`jnl`	Computing the external geodesic diameter of a simple polygon. Computing David Samuel, Godfried T. Toussaint
1990	J	`jnl`	The Graham scan triangulates simple polygons. Pattern Recognit. Lett. Xianshu Kong, Hazel Everett, Godfried T. Toussaint
1989	—	`conf`	Determining Sector Visibility of a Polygon. SCG Binay K. Bhattacharya, David G. Kirkpatrick, Godfried T. Toussaint
1989	J	`jnl`	On Seperating Two Simple Polygons by a Single Translation. Discret. Comput. Geom. Godfried T. Toussaint
1989	J	`jnl`	On geodesic properties of polygons relevant to linear time triangulation. Vis. Comput. Hossam A. ElGindy, Godfried T. Toussaint
1988	J	`jnl`	Computing the Link Center of a Simple Polygon. Discret. Comput. Geom. William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap
1988	J	`jnl`	Computing the Width of a Set. IEEE Trans. Pattern Anal. Mach. Intell. Michael E. Houle, Godfried T. Toussaint
1988	J	`jnl`	Fast algorithms for computing the diameter of a finite planar set. Vis. Comput. Binay K. Bhattacharya, Godfried T. Toussaint
1987	J	`jnl`	Bayes classification rule for the general discrete case. Pattern Recognit. Godfried T. Toussaint
1987	—	`conf`	Computing the Link Center of a Simple Polygon. SCG William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap
1987	J	`jnl`	Separability of pairs of polygons through single translations. Robotica Jörg-Rüdiger Sack, Godfried T. Toussaint
1986	J	`jnl`	A linear-time algorithm for solving the strong hidden-line problem in a simple polygon. Pattern Recognit. Lett. Godfried T. Toussaint
1986	—	`conf`	On Computing Simple Circuits on a Set of Line Segments. SCG David Rappaport, Hiroshi Imai, Godfried T. Toussaint
1986	C	`conf`	Shortest Path Solves Translation Separability of Polygons. IAS Godfried T. Toussaint
1986	J	`jnl`	Shortest path solves edge-to-edge visibility in a polygon. Pattern Recognit. Lett. Godfried T. Toussaint
1986	J	`jnl`	Visibility between two edges of a simple polygon. Vis. Comput. David Avis, Teren Gum, Godfried T. Toussaint
1985	J	`jnl`	A historical note on convex hull finding algorithms. Pattern Recognit. Lett. Godfried T. Toussaint
1985	J	`jnl`	A simple linear algorithm for intersecting convex polygons. Vis. Comput. Godfried T. Toussaint
1985	J	`jnl`	A simple linear hidden-line algorithm for star-shaped polygons. Pattern Recognit. Lett. David Rappaport, Godfried T. Toussaint
1985	—	`conf`	Computating the width of a set. SCG Michael E. Houle, Godfried T. Toussaint
1985	—	`conf`	On Computing and Updating Triangulations. FODO Hossam A. ElGindy, Godfried T. Toussaint
1985	J	`jnl`	On the ultimate convex hull algorithm in practice. Pattern Recognit. Lett. Mary M. McQueen, Godfried T. Toussaint
1985	A	`conf`	Translating Polygons in the Plane. STACS Jörg-Rüdiger Sack, Godfried T. Toussaint
1984	J	`jnl`	A new linear algorithm for triangulating monotone polygons. Pattern Recognit. Lett. Godfried T. Toussaint
1984	J	`jnl`	An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons. Computing Godfried T. Toussaint
1984	J	`jnl`	Complexity, convexity, and unimodality. Int. J. Parallel Program. Godfried T. Toussaint
1984	J	`jnl`	Separation of two monotone polygons in linear time. Robotica Godfried T. Toussaint, Hossam A. ElGindy
1983	J	`jnl`	A counterexample to an algorithm for computing monotone hulls of simple polygons. Pattern Recognit. Lett. Godfried T. Toussaint, Hossam A. ElGindy
1983	J	`jnl`	Applications of a two-dimensional hidden-line algorithm to other geometric problems. Computing Hossam A. ElGindy, David Avis, Godfried T. Toussaint
1983	J	`jnl`	Computing largest empty circles with location constraints. Int. J. Parallel Program. Godfried T. Toussaint
1983	J	`jnl`	Efficient Algorithms for Computing the Maximum Distance Between Two Finite Planar Sets. J. Algorithms Binay K. Bhattacharya, Godfried T. Toussaint
1983	J	`jnl`	On the application of the convex hull to histogram analysis in threshold selection. Pattern Recognit. Lett. Godfried T. Toussaint
1983	J	`jnl`	Optimal algorithms for computing the minimum distance between two finite planar sets. Pattern Recognit. Lett. Godfried T. Toussaint, Binay K. Bhattacharya
1983	J	`jnl`	Review of 'Progress in Pattern Recognition' (Kanal, L.N., and Rosenfeld, A., Eds.; 1981). IEEE Trans. Inf. Theory Godfried T. Toussaint
1983	J	`jnl`	Time- and storage-efficient implementation of an optimal planar convex hull algorithm. Image Vis. Comput. Binay K. Bhattacharya, Godfried T. Toussaint
1982	J	`jnl`	A Counterexample to a Diameter Algorithm for Convex Polygons. IEEE Trans. Pattern Anal. Mach. Intell. Binay K. Bhattacharya, Godfried T. Toussaint
1982	J	`jnl`	A simple O(n log n) algorithm for finding the maximum distance between two finite planar sets. Pattern Recognit. Lett. Godfried T. Toussaint, Jim A. McAlear
1982	J	`jnl`	A simple proof of Pach's extremal theorem for convex polygons. Pattern Recognit. Lett. Godfried T. Toussaint
1982	J	`jnl`	On a convex hull algorithm for polygons and its application to triangulation problems. Pattern Recognit. Godfried T. Toussaint, David Avis
1981	J	`jnl`	A note on linear expected time algorithms for finding convex hulls. Computing Luc Devroye, Godfried T. Toussaint
1981	J	`jnl`	An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge. IEEE Trans. Computers David Avis, Godfried T. Toussaint
1981	J	`jnl`	An efficient algorithm for decomposing a polygon into star-shaped polygons. Pattern Recognit. David Avis, Godfried T. Toussaint
1980	J	`jnl`	The Sensitivity of the Modified Viterbi Algorithm to the Source Statistics. IEEE Trans. Pattern Anal. Mach. Intell. Rajjan Shinghal, Godfried T. Toussaint
1980	J	`jnl`	The relative neighbourhood graph of a finite planar set. Pattern Recognit. Godfried T. Toussaint
1979	J	`jnl`	Classification of atypical cells in the automatic cytoscreening for cervical cancer. Pattern Recognit. Lawrence H. Oliver, Ronald S. Poulsen, Godfried T. Toussaint, C. Louis
1979	J	`jnl`	Experiments in Text Recognition with the Modified Viterbi Algorithm. IEEE Trans. Pattern Anal. Mach. Intell. Rajjan Shinghal, Godfried T. Toussaint
1979	B	`conf`	Some new algorithms and software implementation methods for pattern recognition research part II. software implementation methods. COMPSAC Godfried T. Toussaint, Ron S. Foulsen
1979	B	`conf`	Some new algorithms and software implementation methods for pattern recognition research. COMPSAC Godfried T. Toussaint, Ron S. Foulsen
1978	J	`jnl`	A Fast Convex Hull Algorithm. Inf. Process. Lett. Selim G. Akl, Godfried T. Toussaint
1978	J	`jnl`	An Improved Algorithm to Check for Polygon Similarity. Inf. Process. Lett. Selim G. Akl, Godfried T. Toussaint
1978	J	`jnl`	The use of context in pattern recognition. Pattern Recognit. Godfried T. Toussaint
1977	A*	`conf`	A Simplified Heuristic Version of Raviv's Algorithm for Using Context in Text Recognition. IJCAI R. Schinghal, D. Rosenberg, Godfried T. Toussaint
1977	J	`jnl`	On the detection of structures in noisy pictures. Pattern Recognit. Melvin Cohen, Godfried T. Toussaint
1975	J	`jnl`	Comments on "On a New Class of Bounds on Bayes' Risk in Multihypothesis Pattern Recognition". IEEE Trans. Computers Godfried T. Toussaint
1975	J	`jnl`	Sharper lower bounds for discrimination information in terms of variation (Corresp.). IEEE Trans. Inf. Theory Godfried T. Toussaint
1975	J	`jnl`	Subjective clustering and bibliography of books on pattern recognition. Inf. Sci. Godfried T. Toussaint
1974	J	`jnl`	Bibliography on estimation of misclassification. IEEE Trans. Inf. Theory Godfried T. Toussaint
1974	J	`jnl`	Comments on "The Extraction of Pattern Features from Imperfectly Identified Samples". IEEE Trans. Computers Godfried T. Toussaint
1972	J	`jnl`	Comments on "A Comparison of Seven Techniques for Choosing Subsets of Pattern Recognition Properties". IEEE Trans. Computers Godfried T. Toussaint
1972	J	`jnl`	Comments on "Error Bounds for a Contextual Recognition Procedure". IEEE Trans. Computers Godfried T. Toussaint
1972	J	`jnl`	Comments on "Feature Selection with a Linear Dependence Measure". IEEE Trans. Computers Godfried T. Toussaint, Toomas R. Vilmansen
1972	J	`jnl`	Comments on "The Divergence and Bhattacharyya Distance Measures in Signal Selection". IEEE Trans. Commun. Godfried T. Toussaint
1972	J	`jnl`	Comments on "Theoretical Comparison of a Class of Feature Selection Criteria in Pattern Recognition". IEEE Trans. Computers Godfried T. Toussaint
1972	J	`jnl`	Feature Evaluation with Quadratic Mutual Information. Inf. Process. Lett. Godfried T. Toussaint
1972	J	`jnl`	Polynomial Representation of Classifiers with Independent Discrete-Valued Features. IEEE Trans. Computers Godfried T. Toussaint
1972	J	`jnl`	Results Obtained Using a Simple Character Recognition Procedure on Munson's Handprinted Data. IEEE Trans. Computers A. B. Shahidul Hussain, Godfried T. Toussaint, Robert W. Donaldson
1972	J	`jnl`	Some Inequalities Between Distance Measures for Feature Evaluation. IEEE Trans. Computers Godfried T. Toussaint
1971	J	`jnl`	Comments on "A Dynamic Programming Approach to the Selection of Pattern Features". IEEE Trans. Syst. Man Cybern. Godfried T. Toussaint, A. B. Shahidul Hussain
1971	J	`jnl`	Comments on 'A modified figure of merit for feature selection in pattern recognition' by Paul, J. E., Jr., et al. IEEE Trans. Inf. Theory Godfried T. Toussaint
1971	J	`jnl`	Note on optimal selection of independent binary-valued features for pattern recognition (Corresp.). IEEE Trans. Inf. Theory Godfried T. Toussaint
1971	J	`jnl`	Some Upper Bounds on Error Probability for Multiclass Pattern Recognition. IEEE Trans. Computers Godfried T. Toussaint
1970	J	`jnl`	Algorithms for Recognizing Contour-Traced Handprinted Characters. IEEE Trans. Computers Godfried T. Toussaint, Robert W. Donaldson
1970	J	`jnl`	On a Simple Minkowski Metric Classifier. IEEE Trans. Syst. Sci. Cybern. Godfried T. Toussaint
1970	J	`jnl`	Use of Contextual Constraints in Recognition of Contour-Traced Handprinted Characters. IEEE Trans. Computers Robert W. Donaldson, Godfried T. Toussaint