Godfried T. Toussaint

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
43Computing Signed Permutations of Polygons. Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint. Int. J. Comput. Geometry Appl. (21): 87-100 (2011). Web SearchBibTeXDownload
2010
42Bounded-degree polyhedronization of point sets. 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. CCCG 2010, 99-102. Web SearchBibTeXDownload
2009
41The distance geometry of music. Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood. Comput. Geom. (42): 429-454 (2009). Web SearchBibTeXDownload
2008
40Edge-unfolding nested polyhedral bands. Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint. Comput. Geom. (39): 30-42 (2008). Web SearchBibTeXDownload
39Cauchy's Arm Lemma on a Growing Sphere. Zachary Abel, David Charlton, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Stefan Langerman, Joseph O'Rourke, Val Pinciu, Godfried T. Toussaint. CoRR (abs/0804.0986) (2008). Web SearchBibTeXDownload
38On polyhedra induced by point sets in space. Pankaj K. Agarwal, Ferran Hurtado, Godfried T. Toussaint, Joan Trias. Discrete Applied Mathematics (156): 42-54 (2008). Web SearchBibTeXDownload
2007
37Vertex Pops and Popturns. 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. CCCG 2007, 137-140. Web SearchBibTeX
36The Distance Geometry of Music. Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood. CoRR (abs/0705.4085) (2007). Web SearchBibTeXDownload
35Deflating the Pentagon. Erik D. Demaine, Martin L. Demaine, Thomas Fevens, Antonio Mesa, Michael A. Soss, Diane L. Souvaine, Perouz Taslakian, Godfried T. Toussaint. KyotoCGGT 2007, 56-67. Web SearchBibTeXDownload
2006
34Curves in the Sand: Algorithmic Drawing. 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. CCCG 2006. Web SearchBibTeXDownload
33Polygons Flip Finitely: Flaws and a Fix. Erik D. Demaine, Blaise Gassend, Joseph O'Rourke, Godfried T. Toussaint. CCCG 2006. Web SearchBibTeXDownload
2005
32The Distance Geometry of Deep Rhythms and Scales. Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood. CCCG 2005, 163-166. Web SearchBibTeXDownload
31Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint. Discrete & Computational Geometry (33): 593-604 (2005). Web SearchBibTeXDownload
2004
30Unfolding polyhedral bands. Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint. CCCG 2004, 60-63. Web SearchBibTeXDownload
29Space-efficient planar convex hull algorithms. Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint. Theor. Comput. Sci. (321): 25-40 (2004). Web SearchBibTeXDownload
2003
28Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint. WADS 2003, 451-461. Web SearchBibTeXDownload
2002
27Some Aperture-Angle Optimization Problems. Prosenjit Bose, Ferran Hurtado, Elsa Omańa-Pulido, Jack Snoeyink, Godfried T. Toussaint. Algorithmica (33): 411-435 (2002). Web SearchBibTeXDownload
26Computing signed permutations of polygons. Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint. CCCG 2002, 68-71. Web SearchBibTeXDownload
25On flat-state connectivity of chains with fixed acute angles. Greg Aloupis, Erik D. Demaine, Henk Meijer, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint. CCCG 2002, 27-30. Web SearchBibTeXDownload
24A note on reconfiguring tree linkages: trees can lock. 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. Discrete Applied Mathematics (117): 293-297 (2002). Web SearchBibTeXDownload
23Flat-State Connectivity of Linkages under Dihedral Motions. 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. ISAAC 2002, 369-380. Web SearchBibTeXDownload
22In-Place Planar Convex Hull Algorithms. Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint. LATIN 2002, 494-507. Web SearchBibTeXDownload
2001
21Reconfiguring convex polygons. Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint. Comput. Geom. (20): 85-95 (2001). Web SearchBibTeXDownload
20Locked and Unlocked Polygonal Chains in Three Dimensions. 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. Discrete & Computational Geometry (26): 269-281 (2001). Web SearchBibTeXDownload
19Every Set of Disjoint Line Segments Admits a Binary Tree. Prosenjit Bose, Michael E. Houle, Godfried T. Toussaint. Discrete & Computational Geometry (26): 387-410 (2001). Web SearchBibTeXDownload
2000
18Reconfiguring Convex Polygons. Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint. CCCG 2000. Web SearchBibTeXDownload
17Flipturning polygons. 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. CoRR (cs.CG/0008010) (2000). Web SearchBibTeXDownload
1999
16On Reconfiguring Tree Linkages: Trees can Lock. 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. CoRR (cs.CG/9910024) (1999). Web SearchBibTeXDownload
15Locked and Unlocked Polygonal Chains in 3D. 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. SODA (cs.CG/9910009): 866-867 (1999). Web SearchBibTeXDownload
1998
14Hiding disks in folded polygons. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Godfried T. Toussaint. CCCG 1998. Web SearchBibTeXDownload
13On reconfiguring tree linkages: Trees can lock. 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. CCCG 1998. Web SearchBibTeXDownload
12Locked and Unlocked Polygonal Chains in 3D. 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. CoRR (cs.CG/9811019) (1998). Web SearchBibTeXDownload
1996
11On the Sectional Area of Convex Polytopes. David Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink. Symposium on Computational Geometry 1996, C-11-C-12. Web SearchBibTeXDownload
1994
10Linear Approximation of Simple Objects. Kasturi R. Varadarajan, Pankaj K. Agarwal. Comput. Geom. (4): 27-52 (1994). Web SearchBibTeXDownload
9Every Set of Disjoint Line Segments Admits a Binary Tree. Prosenjit Bose, Michael E. Houle, Godfried T. Toussaint. ISAAC 1994, 20-28. Web SearchBibTeXDownload
1992
8Linear Approximation of Simple Objects. Kasturi R. Varadarajan, Pankaj K. Agarwal. STACS 1992, 233-244. Web SearchBibTeXDownload
1990
7Computing Simple Circuits form a Set of Line Segments. David Rappaport, Hiroshi Imai, Godfried T. Toussaint. Discrete & Computational Geometry (5): 289-304 (1990). Web SearchBibTeXDownload
1989
6Determining Sector Visibility of a Polygon. Binay K. Bhattacharya, David G. Kirkpatrick, Godfried T. Toussaint. Symposium on Computational Geometry 1989, 247-253. Web SearchBibTeXDownload
1988
5Computing the Link Center of a Simple Polygon. William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap. Discrete & Computational Geometry (3): 281-293 (1988). Web SearchBibTeXDownload
4Computing the Width of a Set. Michael E. Houle, Godfried T. Toussaint. IEEE Trans. Pattern Anal. Mach. Intell. (10): 761-765 (1988). Web SearchBibTeXDownload
1987
3Computing the Link Center of a Simple Polygon. William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap. Symposium on Computational Geometry 1987, 1-10. Web SearchBibTeXDownload
1986
2On Computing Simple Circuits on a Set of Line Segments. David Rappaport, Hiroshi Imai, Godfried T. Toussaint. Symposium on Computational Geometry 1986, 52-60. Web SearchBibTeXDownload
1985
1Computating the width of a set. Michael E. Houle, Godfried T. Toussaint. Symposium on Computational Geometry 1985, 1-7. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research