dblp.uni-trier.dewww.uni-trier.de

Godfried T. Toussaint Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2008
131EEEric Thul, Godfried T. Toussaint: Analysis of musical rhythm complexity measures in a cultural context. C3S2E 2008: 1-9
130EEFrancisco Gomez-Martin, Perouz Taslakian, Godfried T. Toussaint: Evenness preserving operations on musical rhythms. C3S2E 2008: 121-123
129EEEric Thul, Godfried T. Toussaint: On the relation between rhythm complexity measures and human rhythmic performance. C3S2E 2008: 199-204
128 Joseph O'Rourke, Perouz Taslakian, Godfried T. Toussaint: A Pumping Lemma for Homometric Rhythms. CCCG 2008
127EEZachary 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)
126EEGreg 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)
125EEPankaj 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)
2007
124 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
123EEErik 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)
122EEJustin 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)
2006
121EEMirela 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
120EEErik D. Demaine, Blaise Gassend, Joseph O'Rourke, Godfried T. Toussaint: Polygons Flip Finitely: Flaws and a Fix. CCCG 2006
119EEJustin 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)
2005
118EEErik 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
117EEGodfried T. Toussaint: Mathematical Features for Recognizing Preference in Sub-saharan African Traditional Rhythm Timelines. ICAPR (1) 2005: 18-27
116EEBinay K. Bhattacharya, Kaustav Mukherjee, Godfried T. Toussaint: Geometric Decision Rules for Instance-Based Learning Problems. PReMI 2005: 60-69
115EEJustin 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)
114EEGodfried T. Toussaint: The Erdös-Nagy theorem and its ramifications . Comput. Geom. 31(3): 219-236 (2005)
113EEDavid 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)
112EEJustin Colannino, Godfried T. Toussaint: An algorithm for computing the restriction scaffold assignment problem in computational biology. Inf. Process. Lett. 95(4): 466-471 (2005)
111EEGodfried 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)
2004
110EEGreg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint: Unfolding polyhedral bands. CCCG 2004: 60-63
109EEGodfried T. Toussaint: A Comparison of Rhythmic Similarity Measures. ISMIR 2004
108EEGodfried T. Toussaint: The Geometry of Musical Rhythm. JCDCG 2004: 198-212
107EEBenjamin Marlin, Godfried T. Toussaint: Constructing convex 3-polytopes from two triangulations of a polygon. Comput. Geom. 28(1): 41-47 (2004)
106EEHervé 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)
2003
105 Ferran Hurtado, Godfried T. Toussaint, Joan Trias: On Polyhedra Induced by Point Sets in Space. CCCG 2003: 107-110
104 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
103EEGodfried T. Toussaint: Geometric Graphs for Improving Nearest Neighbor Decision Rules. ICCSA (3) 2003: 762-765
102EEDavid 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
101EEGreg 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)
2002
100EEGreg 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
99EEBenjamin Marlin, Godfried T. Toussaint: Constructing convex 3-polytopes from two triangulations of a polygon. CCCG 2002: 36-39
98EEGreg 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
97EEGreg 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
96EEGodfried T. Toussaint: Open Problems in Geometric Methods for Instance-Based Learning. JCDCG 2002: 273-283
95EEHervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint: In-Place Planar Convex Hull Algorithms. LATIN 2002: 494-507
94EEProsenjit Bose, Ferran Hurtado, Elsa Omaña-Pulido, Jack Snoeyink, Godfried T. Toussaint: Some Aperture-Angle Optimization Problems. Algorithmica 33(4): 411-435 (2002)
93EEProsenjit 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)
92 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)
91 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)
90 Francisco Gómez, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristan, Godfried T. Toussaint: Implicit Convex Polygons. J. Math. Model. Algorithms 1(1): 57-85 (2002)
89 Elsa Omaña-Pulido, Godfried T. Toussaint: Aperture-Angle Optimization Problems in Three Dimensions. J. Math. Model. Algorithms 1(4): 301-329 (2002)
2001
88EEGreg Aloupis, Stefan Langerman, Michael A. Soss, Godfried T. Toussaint: Algorithms for bivariate medians and a fermat-torricelli problem for lines. CCCG 2001: 21-24
87 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)
86EETherese 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)
85EEProsenjit 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)
84EEJorge 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)
2000
83EEOswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint: Reconfiguring Convex Polygons. CCCG 2000
82EEOswin 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)
1999
81EEGodfried T. Toussaint: The Erdös-Nagy theorem and its ramifications. CCCG 1999
80EETherese 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
79EETherese 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)
78EETherese 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)
77 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- (1999)
1998
76EEElsa Omaña-Pulido, Godfried T. Toussaint: Aperture-angle optimization problems in 3 dimensions. CCCG 1998
75EEFerran Hurtado, Vera Sacristan, Godfried T. Toussaint: Constrainted facility location. CCCG 1998
74EEProsenjit 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
73EETherese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Godfried T. Toussaint: Hiding disks in folded polygons. CCCG 1998
72EETherese 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
71EEFrancisco Gómez, Ferran Hurtado, Joan Antoni Sellarès, Godfried T. Toussaint: Perspective projections and removal of degeneracies. CCCG 1998
70EETherese 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)
69 Suneeta Ramaswami, Pedro A. Ramos, Godfried T. Toussaint: Converting triangulations to quadrangulations. Comput. Geom. 9(4): 257-276 (1998)
68EEProsenjit Bose, Marc J. van Kreveld, Godfried T. Toussaint: Filling polyhedral molds. Computer-Aided Design 30(4): 245-254 (1998)
1997
67EEFrancisco Gómez, Suneeta Ramaswami, Godfried T. Toussaint: On Removing Non-degeneracy Assumptions in Computational Geometry. CIAC 1997: 86-99
66 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)
65 Prosenjit Bose, Thomas C. Shermer, Godfried T. Toussaint, Binhai Zhu: Guarding Polyhedral Terrains. Comput. Geom. 7: 173-185 (1997)
64EEProsenjit Bose, Godfried T. Toussaint: Characterizing and efficiently computing quadrangulations of planar point sets. Computer Aided Geometric Design 14(8): 763-785 (1997)
1996
63EEProsenjit Bose, Godfried T. Toussaint: Computing the Constrained Euclidean Geodesic and Link Center of a Simple Polygon with Application. Computer Graphics International 1996: 102-110
62EEDavid 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
61 Prosenjit Bose, David Bremner, Godfried T. Toussaint: All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers. Comput. Geom. 6: 291-302 (1996)
60 David Eu, Eric Guévremont, Godfried T. Toussaint: On Envelopes of Arrangements of Lines. J. Algorithms 21(1): 111-148 (1996)
1995
59 Prosenjit Bose, Francisco Gómez, Pedro A. Ramos, Godfried T. Toussaint: Drawing Nice Projections of Objects in Space. Graph Drawing 1995: 52-63
58EEProsenjit Bose, Godfried T. Toussaint: No Quadrangulation is Extremely Odd. ISAAC 1995: 372-381
57 Godfried T. Toussaint: Quadrangulations of Planar Sets. WADS 1995: 218-227
56EEProsenjit Bose, Godfried T. Toussaint: Geometric and computational aspects of gravity casting. Computer-Aided Design 27(6): 455-464 (1995)
55 Prosenjit Bose, Godfried T. Toussaint: Growing a Tree from Its Branches. J. Algorithms 19(1): 86-103 (1995)
1994
54 Prosenjit Bose, David Bremner, Godfried T. Toussaint: All Convex Polyhedra can be Clamped with Parallel Jaw Grippers. CCCG 1994: 344-349
53 Chuzo Iwamoto, Godfried T. Toussaint: Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-complete. CCCG 1994: 93-98
52EEProsenjit Bose, Michael E. Houle, Godfried T. Toussaint: Every Set of Disjoint Line Segments Admits a Binary Tree. ISAAC 1994: 20-28
51 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)
50 Jean-Marc Robert, Godfried T. Toussaint: Linear Approximation of Simple Objects. Comput. Geom. 4: 27-52 (1994)
49EEProsenjit Bose, Godfried T. Toussaint: Geometric and computational aspects of manufacturing processes. Computers & Graphics 18(4): 487-497 (1994)
48 Chuzo Iwamoto, Godfried T. Toussaint: Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-Complete. Inf. Process. Lett. 52(4): 183-189 (1994)
47EEGodfried T. Toussaint: A counterexample to Tomek's consistency theorem for a condensed nearest neighbor decision rule. Pattern Recognition Letters 15(8): 797-801 (1994)
1993
46 Godfried T. Toussaint, Clark Verbrugge, Cao An Wang, Binhai Zhu: Tetrahedralization of Simple and Non-Simple Polyhedra. CCCG 1993: 24-29
45EEBoudewijn 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
44 Prosenjit Bose, Marc J. van Kreveld, Godfried T. Toussaint: Filling Polyhedral Molds. WADS 1993: 210-221
43 Luc Devroye, Godfried T. Toussaint: Convex Hulls for Random Lines. J. Algorithms 14(3): 381-394 (1993)
42EEHossam A. ElGindy, Hazel Everett, Godfried T. Toussaint: Slicing an ear using prune-and-search. Pattern Recognition Letters 14(9): 719-722 (1993)
1992
41EEJean-Marc Robert, Godfried T. Toussaint: Linear Approximation of Simple Objects. STACS 1992: 233-244
40 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)
1991
39EEBinay K. Bhattacharya, Godfried T. Toussaint: Computing Shortest Transversals. ICALP 1991: 649-660
38 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
37EEBinay 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
36 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
35EEGodfried T. Toussaint: A counter-example to a convex hull algorithm for polygons. Pattern Recognition 24(2): 183-184 (1991)
34EEBinay 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)
33 Godfried T. Toussaint: Efficient triangulation of simple polygons. The Visual Computer 7(5&6): 280-295 (1991)
1990
32 David Rappaport, Hiroshi Imai, Godfried T. Toussaint: Computing Simple Circuits form a Set of Line Segments. Discrete & Computational Geometry 5: 289-304 (1990)
31EEXianshu Kong, Hazel Everett, Godfried T. Toussaint: The Graham scan triangulates simple polygons. Pattern Recognition Letters 11(11): 713-716 (1990)
1989
30EEBinay K. Bhattacharya, David G. Kirkpatrick, Godfried T. Toussaint: Determining Sector Visibility of a Polygon. Symposium on Computational Geometry 1989: 247-253
29 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)
1988
28 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)
27EEMichael E. Houle, Godfried T. Toussaint: Computing the Width of a Set. IEEE Trans. Pattern Anal. Mach. Intell. 10(5): 761-765 (1988)
26 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)
1987
25EEWilliam 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
24EEGodfried T. Toussaint: Bayes classification rule for the general discrete case. Pattern Recognition 20(4): 411 (1987)
1986
23 Godfried T. Toussaint: Shortest Path Solves Translation Separability of Polygons. IAS 1986: 590-600
22EEDavid Rappaport, Hiroshi Imai, Godfried T. Toussaint: On Computing Simple Circuits on a Set of Line Segments. Symposium on Computational Geometry 1986: 52-60
21 David Avis, Teren Gum, Godfried T. Toussaint: Visibility between two edges of a simple polygon. The Visual Computer 2(6): 342-357 (1986)
1985
20 Hossam A. ElGindy, Godfried T. Toussaint: On Computing and Updating Triangulations. FODO 1985: 249-262
19EEJörg-Rüdiger Sack, Godfried T. Toussaint: Translating Polygons in the Plane. STACS 1985: 310-321
18 Godfried T. Toussaint: A simple linear algorithm for intersecting convex polygons. The Visual Computer 1(2): 118-123 (1985)
1983
17EEHossam 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)
16 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- (1983)
15EEBinay 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)
14 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)
1982
13EEGodfried T. Toussaint, David Avis: On a convex hull algorithm for polygons and its application to triangulation problems. Pattern Recognition 15(1): 23-29 (1982)
1981
12 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)
11EEDavid Avis, Godfried T. Toussaint: An efficient algorithm for decomposing a polygon into star-shaped polygons. Pattern Recognition 13(6): 395-398 (1981)
1980
10EEGodfried T. Toussaint: The relative neighbourhood graph of a finite planar set. Pattern Recognition 12(4): 261-268 (1980)
1979
9EEL. H. Oliver, R. 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)
1978
8 Selim G. Akl, Godfried T. Toussaint: An Improved Algorithm to Check for Polygon Similarity. Inf. Process. Lett. 7(3): 127-128 (1978)
7 Selim G. Akl, Godfried T. Toussaint: A Fast Convex Hull Algorithm. Inf. Process. Lett. 7(5): 219-222 (1978)
6EEGodfried T. Toussaint: The use of context in pattern recognition. Pattern Recognition 10(3): 189-204 (1978)
1977
5 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
4EEMelvin Cohen, Godfried T. Toussaint: On the detection of structures in noisy pictures. Pattern Recognition 9(2): 95-98 (1977)
1975
3 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)
2EEGodfried T. Toussaint: Subjective clustering and bibliography of books on pattern recognition. Inf. Sci. 8(3): 251-257 (1975)
1972
1 Godfried T. Toussaint: Feature Evaluation with Quadratic Mutual Information. Inf. Process. Lett. 1(4): 153-156 (1972)

Coauthor Index

1Zachary Abel [127]
2Vera Sacristán Adinolfi (Vera Sacristan) [74] [75] [90] [91]
3Pankaj K. Agarwal [125]
4Oswin Aichholzer [82] [83] [87]
5Selim G. Akl [7] [8]
6Greg Aloupis [88] [97] [98] [100] [101] [104] [110] [124] [126]
7Boudewijn Asberg [45] [66]
8David Avis [11] [12] [13] [17] [21] [62]
9Brad Ballinger [124]
10Binay K. Bhattacharya [14] [15] [26] [30] [34] [36] [37] [39] [40] [77] [116]
11Therese C. Biedl [70] [72] [73] [78] [79] [80] [86] [92]
12Gregoria Blanco [45] [66]
13Prosenjit Bose [44] [45] [49] [52] [54] [55] [56] [58] [59] [61] [62] [63] [64] [65] [66] [68] [74] [85] [91] [93] [94] [98] [124]
14David Bremner [54] [61] [102] [113]
15Hervé Brönnimann [95] [106]
16Jorge Alberto Calvo [84]
17David Charlton [127]
18Melvin Cohen [4]
19Justin Colannino [112] [115] [119] [122]
20Sébastien Collette [127]
21Carmen Cortés [82]
22Jirel Czyzowicz [38] [40]
23Jurek Czyzowicz [37]
24Mirela Damian (Mirela Damian-Iordache) [115] [119] [121] [124]
25Erik D. Demaine [70] [72] [73] [78] [79] [80] [82] [83] [86] [87] [92] [97] [98] [100] [102] [110] [113] [118] [120] [121] [123] [124] [126] [127]
26Martin L. Demaine [70] [72] [73] [78] [79] [80] [86] [92] [121] [124] [127]
27Luc Devroye [43]
28Vida Dujmovic [82] [97] [121]
29Peter Egyed [37] [38] [40]
30Dania El-Khechen [121]
31Hossam A. ElGindy [17] [20] [29] [42]
32Jeff Erickson [82] [83] [87] [97] [102] [113]
33David Eu [51] [60]
34Hazel Everett [31] [34] [38] [42]
35Thomas Fevens [104]
36Robin Y. Flatland [121] [124]
37Jesus Garcia-Lopez [45] [66]
38Blaise Gassend [120]
39Francisco Gómez [59] [67] [71] [90]
40Francisco Gomez-Martin [118] [123] [130]
41Eric Guévremont [60]
42Teren Gum [21]
43Michael E. Houle [27] [52] [85]
44Ferran Hurtado [71] [74] [75] [83] [87] [90] [91] [94] [105] [115] [119] [124] [125]
45John Iacono [95] [102] [106] [113] [115] [119] [121]
46Hiroshi Imai [22] [32]
47Chuzo Iwamoto [48] [53]
48Jyrki Katajainen [95] [106]
49David G. Kirkpatrick [30]
50Xianshu Kong [31]
51Marc J. van Kreveld [44] [68]
52Danny Krizanc [84]
53Stefan Langerman [88] [97] [98] [101] [102] [104] [110] [113] [121] [124] [126] [127]
54Sylvain Lazard [70] [72] [78] [79] [80] [86] [92]
55William J. Lenhart (William Lenhart) [25] [28]
56C. Louis [9]
57Anna Lubiw [70] [72] [73] [78] [79] [80] [86] [92]
58Benjamin Marlin [99] [107]
59Tomomi Matsui [104]
60Henk Meijer [74] [82] [91] [97] [98] [100] [115] [118] [119] [121] [123]
61Antonio Mesa [104]
62Pat Morin [84] [95] [102] [106] [110] [113] [126]
63Jason Morrison [95] [106]
64Kaustav Mukherjee [116]
65Asish Mukhopadhyay [36] [77]
66Joseph O'Rourke [70] [72] [78] [79] [80] [86] [92] [97] [100] [110] [120] [124] [126] [127] [128]
67L. H. Oliver [9]
68Elsa Omaña-Pulido [76] [89] [94]
69Mark H. Overmars [45] [66] [70] [79] [80] [82] [83] [86] [87] [97] [98]
70Belén Palop [82]
71Val Pinciu [127]
72Richard Pollack [25] [28]
73R. S. Poulsen [9]
74Suneeta Ramaswami [67] [69] [74] [82] [90] [91] [93] [115] [119] [121]
75Pedro A. Ramos [59] [69]
76David Rappaport [22] [32] [38] [74] [91] [104] [118] [123]
77Steve Robbins [70] [72] [78] [79] [80] [86] [92]
78Jean-Marc Robert [41] [50]
79D. Rosenberg [5]
80Jörg-Rüdiger Sack [19] [25] [28]
81R. Schinghal [5]
82Raimund Seidel [25] [28]
83Joan Antoni Sellarès [71]
84Micha Sharir [25] [28]
85Thomas C. Shermer [38] [62] [65] [74] [91]
86Jack Snoeyink [62] [94]
87Michael A. Soss [83] [84] [87] [88] [97] [101]
88Diane L. Souvaine [38] [121]
89Ivan Stojmenovic [37] [40]
90Ileana Streinu [70] [72] [78] [79] [80] [86] [92] [97] [100] [110] [126]
91Subhash Suri [25] [28]
92Perouz Taslakian [118] [121] [123] [124] [128] [130]
93Eric Thul [129] [131]
94Joan Trias [105] [125]
95Alain Turki [93]
96Jorge Urrutia [37] [38] [40]
97Clark Verbrugge [46]
98Cao An Wang [46]
99Sue Whitesides [25] [28] [70] [72] [78] [79] [80] [86] [92]
100Gordon T. Wilfong [45] [66]
101Terry Winograd [118] [123]
102David R. Wood [118] [123]
103Chee-Keng Yap (Chee Yap) [25] [28]
104Binhai Zhu [45] [46] [62] [65] [66]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)