The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Godfried T. Toussaint: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint
    Reconfiguring Convex Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  2. Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint
    Computing signed permutations of polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:68-71 [Conf]
  3. Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint
    Unfolding polyhedral bands. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:60-63 [Conf]
  4. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:27-30 [Conf]
  5. Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, David Rappaport, Godfried T. Toussaint
    Computing the Similarity of two Melodies. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:81-84 [Conf]
  6. Greg Aloupis, Stefan Langerman, Michael A. Soss, Godfried T. Toussaint
    Algorithms for bivariate medians and a fermat-torricelli problem for lines. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:21-24 [Conf]
  7. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  8. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Godfried T. Toussaint
    Hiding disks in folded polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  9. Prosenjit Bose, David Bremner, Godfried T. Toussaint
    All Convex Polyhedra can be Clamped with Parallel Jaw Grippers. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:344-349 [Conf]
  10. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  11. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:163-166 [Conf]
  12. Francisco Gómez, Ferran Hurtado, Joan Antoni Sellarès, Godfried T. Toussaint
    Perspective projections and removal of degeneracies. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  13. Ferran Hurtado, Vera Sacristan, Godfried T. Toussaint
    Constrainted facility location. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  14. Ferran Hurtado, Godfried T. Toussaint, Joan Trias
    On Polyhedra Induced by Point Sets in Space. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:107-110 [Conf]
  15. Chuzo Iwamoto, Godfried T. Toussaint
    Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-complete. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:93-98 [Conf]
  16. Benjamin Marlin, Godfried T. Toussaint
    Constructing convex 3-polytopes from two triangulations of a polygon. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:36-39 [Conf]
  17. Elsa Omaña-Pulido, Godfried T. Toussaint
    Aperture-angle optimization problems in 3 dimensions. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  18. Godfried T. Toussaint
    The Erdös-Nagy theorem and its ramifications. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  19. Godfried T. Toussaint, Clark Verbrugge, Cao An Wang, Binhai Zhu
    Tetrahedralization of Simple and Non-Simple Polyhedra. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:24-29 [Conf]
  20. Prosenjit Bose, Godfried T. Toussaint
    Computing the Constrained Euclidean Geodesic and Link Center of a Simple Polygon with Application. [Citation Graph (0, 0)][DBLP]
    Computer Graphics International, 1996, pp:102-110 [Conf]
  21. Francisco Gómez, Suneeta Ramaswami, Godfried T. Toussaint
    On Removing Non-degeneracy Assumptions in Computational Geometry. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:86-99 [Conf]
  22. David Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink
    On the Sectional Area of Convex Polytopes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:0-11 [Conf]
  23. Binay K. Bhattacharya, Jurek Czyzowicz, Peter Egyed, Ivan Stojmenovic, Godfried T. Toussaint, Jorge Urrutia
    Computing Shortest Transversals of Sets (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:71-80 [Conf]
  24. Binay K. Bhattacharya, David G. Kirkpatrick, Godfried T. Toussaint
    Determining Sector Visibility of a Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:247-253 [Conf]
  25. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:1-10 [Conf]
  26. David Rappaport, Hiroshi Imai, Godfried T. Toussaint
    On Computing Simple Circuits on a Set of Line Segments. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:52-60 [Conf]
  27. Hossam A. ElGindy, Godfried T. Toussaint
    On Computing and Updating Triangulations. [Citation Graph (0, 0)][DBLP]
    FODO, 1985, pp:249-262 [Conf]
  28. 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. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:228-237 [Conf]
  29. Prosenjit Bose, Francisco Gómez, Pedro A. Ramos, Godfried T. Toussaint
    Drawing Nice Projections of Objects in Space. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:52-63 [Conf]
  30. Godfried T. Toussaint
    Shortest Path Solves Translation Separability of Polygons. [Citation Graph (0, 0)][DBLP]
    IAS, 1986, pp:590-600 [Conf]
  31. Binay K. Bhattacharya, Godfried T. Toussaint
    Computing Shortest Transversals. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:649-660 [Conf]
  32. Godfried T. Toussaint
    Mathematical Features for Recognizing Preference in Sub-saharan African Traditional Rhythm Timelines. [Citation Graph (0, 0)][DBLP]
    ICAPR (1), 2005, pp:18-27 [Conf]
  33. Godfried T. Toussaint
    Geometric Graphs for Improving Nearest Neighbor Decision Rules. [Citation Graph (0, 0)][DBLP]
    ICCSA (3), 2003, pp:762-765 [Conf]
  34. R. Schinghal, D. Rosenberg, Godfried T. Toussaint
    A Simplified Heuristic Version of Raviv's Algorithm for Using Context in Text Recognition. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1977, pp:179-180 [Conf]
  35. Prosenjit Bose, Michael E. Houle, Godfried T. Toussaint
    Every Set of Disjoint Line Segments Admits a Binary Tree. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:20-28 [Conf]
  36. 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. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:369-380 [Conf]
  37. Prosenjit Bose, Godfried T. Toussaint
    No Quadrangulation is Extremely Odd. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:372-381 [Conf]
  38. Godfried T. Toussaint
    A Comparison of Rhythmic Similarity Measures. [Citation Graph (0, 0)][DBLP]
    ISMIR, 2004, pp:- [Conf]
  39. Godfried T. Toussaint
    Open Problems in Geometric Methods for Instance-Based Learning. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:273-283 [Conf]
  40. Godfried T. Toussaint
    The Geometry of Musical Rhythm. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:198-212 [Conf]
  41. Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint
    In-Place Planar Convex Hull Algorithms. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:494-507 [Conf]
  42. Binay K. Bhattacharya, Kaustav Mukherjee, Godfried T. Toussaint
    Geometric Decision Rules for Instance-Based Learning Problems. [Citation Graph (0, 0)][DBLP]
    PReMI, 2005, pp:60-69 [Conf]
  43. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:866-867 [Conf]
  44. Jirel Czyzowicz, Peter Egyed, Hazel Everett, David Rappaport, Thomas C. Shermer, Diane L. Souvaine, Godfried T. Toussaint, Jorge Urrutia
    The Aquarium Keeper's Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:459-464 [Conf]
  45. Jean-Marc Robert, Godfried T. Toussaint
    Linear Approximation of Simple Objects. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:233-244 [Conf]
  46. Jörg-Rüdiger Sack, Godfried T. Toussaint
    Translating Polygons in the Plane. [Citation Graph (0, 0)][DBLP]
    STACS, 1985, pp:310-321 [Conf]
  47. 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. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:412-424 [Conf]
  48. Prosenjit Bose, Marc J. van Kreveld, Godfried T. Toussaint
    Filling Polyhedral Molds. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:210-221 [Conf]
  49. 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. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:451-461 [Conf]
  50. Godfried T. Toussaint
    Quadrangulations of Planar Sets. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:218-227 [Conf]
  51. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:19, n:1/2, pp:61-83 [Journal]
  52. Prosenjit Bose, Ferran Hurtado, Elsa Omaña-Pulido, Jack Snoeyink, Godfried T. Toussaint
    Some Aperture-Angle Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:4, pp:411-435 [Journal]
  53. Prosenjit Bose, Godfried T. Toussaint
    Geometric and computational aspects of gravity casting. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 1995, v:27, n:6, pp:455-464 [Journal]
  54. Prosenjit Bose, Marc J. van Kreveld, Godfried T. Toussaint
    Filling polyhedral molds. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 1998, v:30, n:4, pp:245-254 [Journal]
  55. Prosenjit Bose, Suneeta Ramaswami, Godfried T. Toussaint, Alain Turki
    Experimental results on quadrangulations of sets of fixed points. [Citation Graph (0, 0)][DBLP]
    Computer Aided Geometric Design, 2002, v:19, n:7, pp:533-552 [Journal]
  56. Prosenjit Bose, Godfried T. Toussaint
    Characterizing and efficiently computing quadrangulations of planar point sets. [Citation Graph (0, 0)][DBLP]
    Computer Aided Geometric Design, 1997, v:14, n:8, pp:763-785 [Journal]
  57. Prosenjit Bose, Godfried T. Toussaint
    Geometric and computational aspects of manufacturing processes. [Citation Graph (0, 0)][DBLP]
    Computers & Graphics, 1994, v:18, n:4, pp:487-497 [Journal]
  58. Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint
    Reconfiguring convex polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2001, v:20, n:1-2, pp:85-95 [Journal]
  59. Greg Aloupis, Stefan Langerman, Michael A. Soss, Godfried T. Toussaint
    Algorithms for bivariate medians and a Fermat-Torricelli problem for lines. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:26, n:1, pp:69-79 [Journal]
  60. Prosenjit Bose, David Bremner, Godfried T. Toussaint
    All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:291-302 [Journal]
  61. Prosenjit Bose, Thomas C. Shermer, Godfried T. Toussaint, Binhai Zhu
    Guarding Polyhedral Terrains. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:173-185 [Journal]
  62. Benjamin Marlin, Godfried T. Toussaint
    Constructing convex 3-polytopes from two triangulations of a polygon. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:28, n:1, pp:41-47 [Journal]
  63. Godfried T. Toussaint
    The Erdös-Nagy theorem and its ramifications . [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:31, n:3, pp:219-236 [Journal]
  64. Suneeta Ramaswami, Pedro A. Ramos, Godfried T. Toussaint
    Converting triangulations to quadrangulations. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:9, n:4, pp:257-276 [Journal]
  65. Jean-Marc Robert, Godfried T. Toussaint
    Linear Approximation of Simple Objects. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1994, v:4, n:, pp:27-52 [Journal]
  66. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  67. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  68. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  69. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  70. David Eu, Godfried T. Toussaint
    On Approximating Polygonal Curves in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP]
    CVGIP: Graphical Model and Image Processing, 1994, v:56, n:3, pp:231-246 [Journal]
  71. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:117, n:1-3, pp:293-297 [Journal]
  72. Prosenjit Bose, Michael E. Houle, Godfried T. Toussaint
    Every Set of Disjoint Line Segments Admits a Binary Tree. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:3, pp:387-410 [Journal]
  73. 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. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:3, pp:269-281 [Journal]
  74. 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. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:4, pp:593-604 [Journal]
  75. 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. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:281-293 [Journal]
  76. David Rappaport, Hiroshi Imai, Godfried T. Toussaint
    Computing Simple Circuits form a Set of Line Segments. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:289-304 [Journal]
  77. Binay K. Bhattacharya, Jirel Czyzowicz, Peter Egyed, Godfried T. Toussaint, Ivan Stojmenovic, Jorge Urrutia
    Computing shortest transversals of sets. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:4, pp:417-442 [Journal]
  78. Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint
    Computing a Shortest Weakly Externally Visible Line Segment for a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1999, v:9, n:1, pp:81-0 [Journal]
  79. Godfried T. Toussaint
    Geometric proximity graphs for improving nearest neighbor methods in instance-based learning and data mining. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2005, v:15, n:2, pp:101-150 [Journal]
  80. Selim G. Akl, Godfried T. Toussaint
    An Improved Algorithm to Check for Polygon Similarity. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1978, v:7, n:3, pp:127-128 [Journal]
  81. Selim G. Akl, Godfried T. Toussaint
    A Fast Convex Hull Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1978, v:7, n:5, pp:219-222 [Journal]
  82. Jorge Alberto Calvo, Danny Krizanc, Pat Morin, Michael A. Soss, Godfried T. Toussaint
    Convexifying polygons with simple projections. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:80, n:2, pp:81-86 [Journal]
  83. Justin Colannino, Godfried T. Toussaint
    An algorithm for computing the restriction scaffold assignment problem in computational biology. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:95, n:4, pp:466-471 [Journal]
  84. Chuzo Iwamoto, Godfried T. Toussaint
    Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-Complete. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:52, n:4, pp:183-189 [Journal]
  85. Godfried T. Toussaint
    Feature Evaluation with Quadratic Mutual Information. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1972, v:1, n:4, pp:153-156 [Journal]
  86. 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]. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:103, n:1, pp:44- [Journal]
  87. Godfried T. Toussaint
    Subjective clustering and bibliography of books on pattern recognition. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1975, v:8, n:3, pp:251-257 [Journal]
  88. Binay K. Bhattacharya, Godfried T. Toussaint
    Time- and storage-efficient implementation of an optimal planar convex hull algorithm. [Citation Graph (0, 0)][DBLP]
    Image Vision Comput., 1983, v:1, n:3, pp:140-144 [Journal]
  89. Binay K. Bhattacharya, Godfried T. Toussaint
    Efficient Algorithms for Computing the Maximum Distance Between Two Finite Planar Sets. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1983, v:4, n:2, pp:121-136 [Journal]
  90. Prosenjit Bose, Godfried T. Toussaint
    Growing a Tree from Its Branches. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:1, pp:86-103 [Journal]
  91. Luc Devroye, Godfried T. Toussaint
    Convex Hulls for Random Lines. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:14, n:3, pp:381-394 [Journal]
  92. David Eu, Eric Guévremont, Godfried T. Toussaint
    On Envelopes of Arrangements of Lines. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:1, pp:111-148 [Journal]
  93. 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. [Citation Graph (0, 0)][DBLP]
    J. Math. Model. Algorithms, 2002, v:1, n:1, pp:3-16 [Journal]
  94. Francisco Gómez, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristan, Godfried T. Toussaint
    Implicit Convex Polygons. [Citation Graph (0, 0)][DBLP]
    J. Math. Model. Algorithms, 2002, v:1, n:1, pp:57-85 [Journal]
  95. Elsa Omaña-Pulido, Godfried T. Toussaint
    Aperture-Angle Optimization Problems in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    J. Math. Model. Algorithms, 2002, v:1, n:4, pp:301-329 [Journal]
  96. Michael E. Houle, Godfried T. Toussaint
    Computing the Width of a Set. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1988, v:10, n:5, pp:761-765 [Journal]
  97. David Avis, Godfried T. Toussaint
    An efficient algorithm for decomposing a polygon into star-shaped polygons. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1981, v:13, n:6, pp:395-398 [Journal]
  98. Melvin Cohen, Godfried T. Toussaint
    On the detection of structures in noisy pictures. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1977, v:9, n:2, pp:95-98 [Journal]
  99. L. H. Oliver, R. S. Poulsen, Godfried T. Toussaint, C. Louis
    Classification of atypical cells in the automatic cytoscreening for cervical cancer. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1979, v:11, n:3, pp:205-212 [Journal]
  100. Godfried T. Toussaint
    The use of context in pattern recognition. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1978, v:10, n:3, pp:189-204 [Journal]
  101. Godfried T. Toussaint
    The relative neighbourhood graph of a finite planar set. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1980, v:12, n:4, pp:261-268 [Journal]
  102. Godfried T. Toussaint
    Bayes classification rule for the general discrete case. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1987, v:20, n:4, pp:411- [Journal]
  103. Godfried T. Toussaint
    A counter-example to a convex hull algorithm for polygons. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1991, v:24, n:2, pp:183-184 [Journal]
  104. Godfried T. Toussaint, David Avis
    On a convex hull algorithm for polygons and its application to triangulation problems. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1982, v:15, n:1, pp:23-29 [Journal]
  105. Binay K. Bhattacharya, Hazel Everett, Godfried T. Toussaint
    A counterexample to a dynamic algorithm for convex hulls of line arrangements. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 1991, v:12, n:3, pp:145-147 [Journal]
  106. Hossam A. ElGindy, Hazel Everett, Godfried T. Toussaint
    Slicing an ear using prune-and-search. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 1993, v:14, n:9, pp:719-722 [Journal]
  107. Xianshu Kong, Hazel Everett, Godfried T. Toussaint
    The Graham scan triangulates simple polygons. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 1990, v:11, n:11, pp:713-716 [Journal]
  108. Godfried T. Toussaint
    A counterexample to Tomek's consistency theorem for a condensed nearest neighbor decision rule. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 1994, v:15, n:8, pp:797-801 [Journal]
  109. David Avis, Godfried T. Toussaint
    An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1981, v:30, n:12, pp:910-914 [Journal]
  110. Godfried T. Toussaint
    Comments on ``On a New Class of Bounds on Bayes' Risk in Multihypothesis Pattern Recognition''. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1975, v:24, n:8, pp:855-856 [Journal]
  111. Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint
    Space-efficient planar convex hull algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:1, pp:25-40 [Journal]
  112. Godfried T. Toussaint
    Review of 'Progress in Pattern Recognition' (Kanal, L.N., and Rosenfeld, A., Eds.; 1981). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:5, pp:779-0 [Journal]
  113. David Avis, Teren Gum, Godfried T. Toussaint
    Visibility between two edges of a simple polygon. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1986, v:2, n:6, pp:342-357 [Journal]
  114. Binay K. Bhattacharya, Godfried T. Toussaint
    Fast algorithms for computing the diameter of a finite planar set. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1988, v:3, n:6, pp:379-388 [Journal]
  115. Hossam A. ElGindy, Godfried T. Toussaint
    On geodesic properties of polygons relevant to linear time triangulation. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1989, v:5, n:1&2, pp:68-74 [Journal]
  116. Godfried T. Toussaint
    A simple linear algorithm for intersecting convex polygons. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1985, v:1, n:2, pp:118-123 [Journal]
  117. Godfried T. Toussaint
    Efficient triangulation of simple polygons. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1991, v:7, n:5&6, pp:280-295 [Journal]
  118. Erik D. Demaine, Blaise Gassend, Joseph O'Rourke, Godfried T. Toussaint
    Polygons Flip Finitely: Flaws and a Fix. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  119. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:137-140 [Conf]
  120. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  121. Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint
    Edge-unfolding nested polyhedral bands. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2008, v:39, n:1, pp:30-42 [Journal]
  122. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  123. A Pumping Lemma for Homometric Rhythms. [Citation Graph (, )][DBLP]


  124. Bounded-degree polyhedronization of point sets. [Citation Graph (, )][DBLP]


  125. Computating the width of a set. [Citation Graph (, )][DBLP]


  126. Rhythm Complexity Measures: A Comparison of Mathematical Models of Human Perception and Performance. [Citation Graph (, )][DBLP]


  127. Evenness preserving operations on musical rhythms. [Citation Graph (, )][DBLP]


  128. On the relation between rhythm complexity measures and human rhythmic performance. [Citation Graph (, )][DBLP]


  129. Analysis of musical rhythm complexity measures in a cultural context. [Citation Graph (, )][DBLP]


  130. The distance geometry of music. [Citation Graph (, )][DBLP]


  131. Computational geometric aspects of rhythm, melody, and voice-leading. [Citation Graph (, )][DBLP]


  132. Applications of a two-dimensional hidden-line algorithm to other geometric problems. [Citation Graph (, )][DBLP]


  133. An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment [Citation Graph (, )][DBLP]


  134. Cauchy's Arm Lemma on a Growing Sphere [Citation Graph (, )][DBLP]


  135. On polyhedra induced by point sets in space. [Citation Graph (, )][DBLP]


Search in 0.504secs, Finished in 0.508secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002