default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGodfried T. Toussaint
- > Home > Persons > Godfried T. Toussaint
Publications
- 2017
[c77]Lingliang Zhang, Nizar Habash
, Godfried Toussaint:
Robust Dictionary Lookup in Multiple Noisy Orthographies. WANLP@EACL 2017: 119-129- 2015
- [j122]Mustafa Mohamad, David Rappaport, Godfried Toussaint:
Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences. Graphs Comb. 31(5): 1637-1648 (2015) - [c76]Seung Man Oh, Godfried T. Toussaint, Erik D. Demaine, Martin L. Demaine:
A Dissimilarity Measure for Comparing Origami Crease Patterns. ICPRAM (1) 2015: 386-393 - 2014
- [c74]Moïri Gamboni, Abhijai Garg, Oleg Grishin, Seung Man Oh, Francis Sowani, Anthony Spalvieri-Kruse, Godfried T. Toussaint, Lingliang Zhang:
An Empirical Comparison of Support Vector Machines Versus Nearest Neighbour Methods for Machine Learning Applications. ICPRAM (Selected Papers) 2014: 110-129 - [c73]Moïri Gamboni, Abhijai Garg, Oleg Grishin, Seung Man Oh, Francis Sowani, Anthony Spalvieri-Kruse, Godfried T. Toussaint, Lingliang Zhang:
Speeding up Support Vector Machines - Probabilistic versus Nearest Neighbour Methods for Condensing Training Data. ICPRAM 2014: 364-371 - 2013
- [j120]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:
Bounded-degree polyhedronization of point sets. Comput. Geom. 46(2): 148-153 (2013) - 2011
- [j119]Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint:
Computing Signed Permutations of Polygons. Int. J. Comput. Geom. Appl. 21(1): 87-100 (2011) - [c69]David Rappaport, Godfried T. Toussaint, Mustafa Mohamad:
Minimum Many to Many Matchings for Computing the Distance Between Two Sequences. CCCG 2011 - [c68]Csaba D. Tóth, Godfried T. Toussaint, Andrew Winslow:
Open Guard Edges and Edge Guards in Simple Polygons. CCCG 2011 - [c67]Giovanni Viglietta, Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anastasia Kurdia, Joseph O'Rourke, Godfried T. Toussaint, Jorge Urrutia:
Edge-guarding Orthogonal Polyhedra. CCCG 2011 - [c66]Csaba D. Tóth, Godfried T. Toussaint, Andrew Winslow:
Open Guard Edges and Edge Guards in Simple Polygons. EGC 2011: 54-64 - 2010
- [c65]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:
Bounded-degree polyhedronization of point sets. CCCG 2010: 99-102 - 2009
- [j117]Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood:
The distance geometry of music. Comput. Geom. 42(5): 429-454 (2009) - 2008
- [j116]Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint:
Edge-unfolding nested polyhedral bands. Comput. Geom. 39(1): 30-42 (2008) - [j115]Pankaj K. Agarwal, Ferran Hurtado, Godfried T. Toussaint, Joan Trias:
On polyhedra induced by point sets in space. Discret. Appl. Math. 156(1): 42-54 (2008) - [c64]Eric Thul, Godfried T. Toussaint:
Analysis of musical rhythm complexity measures in a cultural context. C3S2E 2008: 1-9 - [c63]Francisco Gomez-Martin, Perouz Taslakian, Godfried T. Toussaint:
Evenness preserving operations on musical rhythms. C3S2E 2008: 121-123 - [c62]Eric Thul, Godfried T. Toussaint:
On the relation between rhythm complexity measures and human rhythmic performance. C3S2E 2008: 199-204 - [c61]Joseph O'Rourke, Perouz Taslakian, Godfried T. Toussaint:
A Pumping Lemma for Homometric Rhythms. CCCG 2008 - [c60]Eric Thul, Godfried T. Toussaint:
Rhythm Complexity Measures: A Comparison of Mathematical Models of Human Perception and Performance. ISMIR 2008: 663-668 - [i7]Zachary Abel, David Charlton, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Stefan Langerman, Joseph O'Rourke, Val Pinciu, Godfried T. Toussaint:
Cauchy's Arm Lemma on a Growing Sphere. CoRR abs/0804.0986 (2008) - 2007
- [j114]Justin Colannino, Mirela Damian, Ferran Hurtado, Stefan Langerman, Henk Meijer, Suneeta Ramaswami, Diane L. Souvaine, Godfried Toussaint:
Efficient Many-To-Many Point Matching in One Dimension. Graphs Comb. 23(Supplement-1): 169-178 (2007) - [j113]Justin Colannino, Godfried T. Toussaint:
Corrigendum to "An algorithm for computing the restriction Scaffold assignment problem in computational biology" [Inform Process Lett 95 (4) (2005) 466-471]. Inf. Process. Lett. 103(1): 44 (2007) - [c59]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 - [c58]Francisco Gómez, Eric Thul, Godfried Toussaint:
An Experimental Comparison of Formal Measures of rhythmic Syncopation. ICMC 2007 - [c57]Erik D. Demaine, Martin L. Demaine, Thomas Fevens, Antonio Mesa, Michael A. Soss, Diane L. Souvaine, Perouz Taslakian, Godfried T. Toussaint:
Deflating the Pentagon. KyotoCGGT 2007: 56-67 - [i6]Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood:
The Distance Geometry of Music. CoRR abs/0705.4085 (2007) - 2006
- [j112]Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Núñez Rodríguez, David Rappaport, Godfried T. Toussaint:
Algorithms for Computing Geometric Measures of Melodic Similarity. Comput. Music. J. 30(3): 67-76 (2006) - [j111]Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, Godfried T. Toussaint:
An O(n log n)-Time Algorithm for the Restriction Scaffold Assignment Problem. J. Comput. Biol. 13(4): 979-989 (2006) - [c56]Mirela Damian, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Dania El-Khechen, Robin Y. Flatland, John Iacono, Stefan Langerman, Henk Meijer, Suneeta Ramaswami, Diane L. Souvaine, Perouz Taslakian, Godfried T. Toussaint:
Curves in the Sand: Algorithmic Drawing. CCCG 2006 - [c55]Erik D. Demaine, Blaise Gassend, Joseph O'Rourke, Godfried T. Toussaint:
Polygons Flip Finitely: Flaws and a Fix. CCCG 2006 - 2005
- [j109]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. Discret. Comput. Geom. 33(4): 593-604 (2005) - [j107]Justin Colannino, Godfried T. Toussaint:
An algorithm for computing the restriction scaffold assignment problem in computational biology. Inf. Process. Lett. 95(4): 466-471 (2005) - [c54]Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood:
The Distance Geometry of Deep Rhythms and Scales. CCCG 2005: 163-166 - [c52]Binay K. Bhattacharya, Kaustav Mukherjee, Godfried T. Toussaint:
Geometric Decision Rules for Instance-Based Learning Problems. PReMI 2005: 60-69 - [i5]Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, Godfried T. Toussaint:
An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment. CoRR abs/cs/0507013 (2005) - 2004
- [j105]Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint:
Space-efficient planar convex hull algorithms. Theor. Comput. Sci. 321(1): 25-40 (2004) - [c51]Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint:
Unfolding polyhedral bands. CCCG 2004: 60-63 - [r1]Joseph O'Rourke, Godfried T. Toussaint:
Pattern recognition. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 1135-1162 - 2003
- [j104]Greg Aloupis, Stefan Langerman, Michael A. Soss, Godfried T. Toussaint:
Algorithms for bivariate medians and a Fermat-Torricelli problem for lines. Comput. Geom. 26(1): 69-79 (2003) - [c48]Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Núñez Rodríguez, David Rappaport, Godfried T. Toussaint:
Computing the Similarity of two Melodies. CCCG 2003: 81-84 - [c47]Ferran Hurtado, Godfried T. Toussaint, Joan Trias:
On Polyhedra Induced by Point Sets in Space. CCCG 2003: 107-110 - [c45]David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint:
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. WADS 2003: 451-461 - 2002
- [j102]Prosenjit Bose, Ferran Hurtado, Elsa Omaña-Pulido, Jack Snoeyink, Godfried T. Toussaint:
Some Aperture-Angle Optimization Problems. Algorithmica 33(4): 411-435 (2002) - [j101]Prosenjit Bose, Suneeta Ramaswami, Godfried T. Toussaint, Alain Turki:
Experimental results on quadrangulations of sets of fixed points. Comput. Aided Geom. Des. 19(7): 533-552 (2002) - [j100]Therese 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. Discret. Appl. Math. 117(1-3): 293-297 (2002) - [j99]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. Discret. Comput. Geom. 28(2): 231-253 (2002) - [j98]Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristán, Thomas C. Shermer, Godfried T. Toussaint:
Finding Specified Sections of Arrangements: 2D Results. J. Math. Model. Algorithms 1(1): 3-16 (2002) - [j97]Francisco Gómez, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristán, Godfried T. Toussaint:
Implicit Convex Polygons. J. Math. Model. Algorithms 1(1): 57-85 (2002) - [j96]Elsa Omaña-Pulido, Godfried T. Toussaint:
Aperture-Angle Optimization Problems in Three Dimensions. J. Math. Model. Algorithms 1(4): 301-329 (2002) - [j95]Francisco Gómez, Suneeta Ramaswami, Godfried Toussaint:
On Computing General Position Views of Data in Three Dimensions. J. Vis. Commun. Image Represent. 13(4): 401-424 (2002) - [c44]Greg Aloupis, Erik D. Demaine, Henk Meijer, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint:
On flat-state connectivity of chains with fixed acute angles. CCCG 2002: 27-30 - [c42]Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint:
Computing signed permutations of polygons. CCCG 2002: 68-71 - [c41]Greg Aloupis, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Stefan Langerman, Henk Meijer, Joseph O'Rourke, Mark H. Overmars, Michael A. Soss, Ileana Streinu, Godfried T. Toussaint:
Flat-State Connectivity of Linkages under Dihedral Motions. ISAAC 2002: 369-380 - [c39]Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint:
In-Place Planar Convex Hull Algorithms. LATIN 2002: 494-507 - 2001
- [j94]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) - [j93]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:
Locked and Unlocked Polygonal Chains in Three Dimensions. Discret. Comput. Geom. 26(3): 269-281 (2001) - [j92]Prosenjit Bose, Michael E. Houle, Godfried T. Toussaint:
Every Set of Disjoint Line Segments Admits a Binary Tree. Discret. Comput. Geom. 26(3): 387-410 (2001) - [j91]Jorge Alberto Calvo, Danny Krizanc, Pat Morin, Michael A. Soss, Godfried T. Toussaint:
Convexifying polygons with simple projections. Inf. Process. Lett. 80(2): 81-86 (2001) - [j90]Francisco Gómez, Ferran Hurtado, Joan Antoni Sellarès, Godfried Toussaint:
Nice Perspective Projections. J. Vis. Commun. Image Represent. 12(4): 387-400 (2001) - [c38]Greg Aloupis, Stefan Langerman, Michael A. Soss, Godfried T. Toussaint:
Algorithms for bivariate medians and a fermat-torricelli problem for lines. CCCG 2001: 21-24 - 2000
- [c37]Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint:
Reconfiguring Convex Polygons. CCCG 2000 - [i4]Oswin Aichholzer, Carmen Cortés, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Henk Meijer, Mark H. Overmars, Belén Palop, Suneeta Ramaswami, Godfried T. Toussaint:
Flipturning polygons. CoRR cs.CG/0008010 (2000) - 1999
- [j89]Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint:
Computing a Shortest Weakly Externally Visible Line Segment for a Simple Polygon. Int. J. Comput. Geom. Appl. 9(1): 81-96 (1999) - [j88]Prosenjit Bose, Francisco Gómez, Pedro Ramos, Godfried Toussaint:
Drawing Nice Projections of Objects in Space. J. Vis. Commun. Image Represent. 10(2): 155-172 (1999) - [c35]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:
Locked and Unlocked Polygonal Chains in 3D. SODA 1999: 866-867 - [i3]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:
Locked and Unlocked Polygonal Chains in 3D. CoRR cs.CG/9910009 (1999) - [i2]Therese 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) - 1998
- [j87]Prosenjit Bose, Marc J. van Kreveld, Godfried T. Toussaint:
Filling polyhedral molds. Comput. Aided Des. 30(4): 245-254 (1998) - [j86]Suneeta Ramaswami, Pedro A. Ramos, Godfried T. Toussaint:
Converting triangulations to quadrangulations. Comput. Geom. 9(4): 257-276 (1998) - [c34]Therese 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 - [c33]Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Godfried T. Toussaint:
Hiding disks in folded polygons. CCCG 1998 - [c32]Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristán, Thomas C. Shermer, Godfried T. Toussaint:
Finding specified sections of arrangements: 2d results. CCCG 1998 - [c31]Francisco Gómez, Ferran Hurtado, Joan Antoni Sellarès, Godfried T. Toussaint:
Perspective projections and removal of degeneracies. CCCG 1998 - [c30]Ferran Hurtado, Vera Sacristán, Godfried T. Toussaint:
Constrainted facility location. CCCG 1998 - [c29]Elsa Omaña-Pulido, Godfried T. Toussaint:
Aperture-angle optimization problems in 3 dimensions. CCCG 1998 - [i1]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:
Locked and Unlocked Polygonal Chains in 3D. CoRR cs.CG/9811019 (1998) - 1997
- [j85]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) - [j84]Prosenjit Bose, Godfried T. Toussaint:
Characterizing and efficiently computing quadrangulations of planar point sets. Comput. Aided Geom. Des. 14(8): 763-785 (1997) - [j83]Prosenjit Bose, Thomas C. Shermer, Godfried T. Toussaint, Binhai Zhu:
Guarding Polyhedral Terrains. Comput. Geom. 7: 173-185 (1997) - [c28]Francisco Gómez, Suneeta Ramaswami, Godfried T. Toussaint:
On Removing Non-degeneracy Assumptions in Computational Geometry. CIAC 1997: 86-99 - 1996
- [j82]Prosenjit Bose, David Bremner, Godfried T. Toussaint:
All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers. Comput. Geom. 6: 291-302 (1996) - [j81]David Eu, Eric Guévremont, Godfried T. Toussaint:
On Envelopes of Arrangements of Lines. J. Algorithms 21(1): 111-148 (1996) - [c27]Prosenjit Bose, Godfried T. Toussaint:
Computing the Constrained Euclidean Geodesic and Link Center of a Simple Polygon with Application. Computer Graphics International 1996: 102-110 - [c26]David Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink:
On the Sectional Area of Convex Polytopes. SCG 1996: C-11-C-12 - 1995
- [j80]Prosenjit Bose, Godfried T. Toussaint:
Geometric and computational aspects of gravity casting. Comput. Aided Des. 27(6): 455-464 (1995) - [j79]Prosenjit Bose, Godfried T. Toussaint:
Growing a Tree from Its Branches. J. Algorithms 19(1): 86-103 (1995) - [c25]Prosenjit Bose, Ferran Hurtado, Elsa Omaña-Pulido, Godfried T. Toussaint:
Aperture angle optimization problems. CCCG 1995: 73-78 - [c24]Prosenjit Bose, Francisco Gómez, Pedro A. Ramos, Godfried T. Toussaint:
Drawing Nice Projections of Objects in Space. GD 1995: 52-63 - [c23]Prosenjit Bose, Godfried T. Toussaint:
No Quadrangulation is Extremely Odd. ISAAC 1995: 372-381 - 1994
- [j78]Prosenjit Bose, Godfried T. Toussaint:
Geometric and computational aspects of manufacturing processes. Comput. Graph. 18(4): 487-497 (1994) - [j77]Jean-Marc Robert, Godfried T. Toussaint:
Linear Approximation of Simple Objects. Comput. Geom. 4: 27-52 (1994) - [j76]David Eu, Godfried T. Toussaint:
On Approximating Polygonal Curves in Two and Three Dimensions. CVGIP Graph. Model. Image Process. 56(3): 231-246 (1994) - [c20]Prosenjit Bose, David Bremner, Godfried T. Toussaint:
All Convex Polyhedra can be Clamped with Parallel Jaw Grippers. CCCG 1994: 344-349 - [c19]Prosenjit Bose, Michael E. Houle, Godfried T. Toussaint:
Every Set of Disjoint Line Segments Admits a Binary Tree. ISAAC 1994: 20-28 - 1993
- [j73]Luc Devroye, Godfried T. Toussaint:
Convex Hulls for Random Lines. J. Algorithms 14(3): 381-394 (1993) - [j72]Hossam A. ElGindy, Hazel Everett, Godfried T. Toussaint:
Slicing an ear using prune-and-search. Pattern Recognit. Lett. 14(9): 719-722 (1993) - [c18]Godfried T. Toussaint, Clark Verbrugge, Cao An Wang, Binhai Zhu:
Tetrahedralization of Simple and Non-Simple Polyhedra. CCCG 1993: 24-29 - [c17]Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose, Jesus Garcia-Lopez, Mark H. Overmars, Godfried T. Toussaint, Gordon T. Wilfong, Binhai Zhu:
Feasability of Design in Stereolithography. FSTTCS 1993: 228-237 - [c16]Prosenjit Bose, Marc J. van Kreveld, Godfried T. Toussaint:
Filling Polyhedral Molds. WADS 1993: 210-221 - 1992
- [j71]Binay K. Bhattacharya, Jurek Czyzowicz, Peter Egyed, Godfried T. Toussaint, Ivan Stojmenovic, Jorge Urrutia:
Computing shortest transversals of sets. Int. J. Comput. Geom. Appl. 2(4): 417-442 (1992) - [c15]Jean-Marc Robert, Godfried T. Toussaint:
Linear Approximation of Simple Objects. STACS 1992: 233-244 - 1991
- [j69]Binay Bhattacharya, Godfried Toussaint:
Computing shortest transversals. Computing 46(2): 93-119 (1991) - [j67]Binay K. Bhattacharya, Hazel Everett, Godfried T. Toussaint:
A counterexample to a dynamic algorithm for convex hulls of line arrangements. Pattern Recognit. Lett. 12(3): 145-147 (1991) - [c14]Binay K. Bhattacharya, Jurek Czyzowicz, Peter Egyed, Ivan Stojmenovic, Godfried T. Toussaint, Jorge Urrutia:
Computing Shortest Transversals of Sets (Extended Abstract). SCG 1991: 71-80 - [c13]Binay K. Bhattacharya, Godfried T. Toussaint:
Computing Shortest Transversals. ICALP 1991: 649-660 - [c12]Jurek 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 - [c11]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 - 1990
- [j64]David Rappaport, Hiroshi Imai, Godfried T. Toussaint:
Computing Simple Circuits form a Set of Line Segments. Discret. Comput. Geom. 5: 289-304 (1990) - [j63]Xianshu Kong, Hazel Everett, Godfried T. Toussaint:
The Graham scan triangulates simple polygons. Pattern Recognit. Lett. 11(11): 713-716 (1990) - 1989
- [j61]Hossam A. ElGindy, Godfried T. Toussaint:
On geodesic properties of polygons relevant to linear time triangulation. Vis. Comput. 5(1&2): 68-74 (1989) - [c10]Binay K. Bhattacharya, David G. Kirkpatrick, Godfried T. Toussaint:
Determining Sector Visibility of a Polygon. SCG 1989: 247-253 - 1988
- [j60]William J. 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. Discret. Comput. Geom. 3: 281-293 (1988) - [j59]Michael E. Houle, Godfried T. Toussaint:
Computing the Width of a Set. IEEE Trans. Pattern Anal. Mach. Intell. 10(5): 761-765 (1988) - [j58]Binay K. Bhattacharya, Godfried T. Toussaint:
Fast algorithms for computing the diameter of a finite planar set. Vis. Comput. 3(6): 379-388 (1988) - 1987
- [j56]Jörg-Rüdiger Sack, Godfried T. Toussaint:
Separability of pairs of polygons through single translations. Robotica 5(1): 55-63 (1987) - [c9]William J. 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. SCG 1987: 1-10 - 1986
- [j53]David Avis, Teren Gum, Godfried T. Toussaint:
Visibility between two edges of a simple polygon. Vis. Comput. 2(6): 342-357 (1986) - [c8]David Rappaport, Hiroshi Imai, Godfried T. Toussaint:
On Computing Simple Circuits on a Set of Line Segments. SCG 1986: 52-60 - 1985
- [j50]David Rappaport, Godfried T. Toussaint:
A simple linear hidden-line algorithm for star-shaped polygons. Pattern Recognit. Lett. 3(1): 35-39 (1985) - [c6]Michael E. Houle, Godfried T. Toussaint:
Computating the width of a set. SCG 1985: 1-7 - [c5]Hossam A. ElGindy, Godfried T. Toussaint:
On Computing and Updating Triangulations. FODO 1985: 249-262 - [c4]Jörg-Rüdiger Sack, Godfried T. Toussaint:
Translating Polygons in the Plane. STACS 1985: 310-321 - 1984
- [j45]Godfried T. Toussaint, Hossam A. ElGindy:
Separation of two monotone polygons in linear time. Robotica 2(4): 215-220 (1984) - 1983
- [j44]Hossam A. ElGindy, David Avis, Godfried T. Toussaint:
Applications of a two-dimensional hidden-line algorithm to other geometric problems. Computing 31(3): 191-202 (1983) - [j42]Binay K. Bhattacharya, Godfried T. Toussaint:
Time- and storage-efficient implementation of an optimal planar convex hull algorithm. Image Vis. Comput. 1(3): 140-144 (1983) - [j41]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) - [j40]Godfried T. Toussaint, Hossam A. ElGindy:
A counterexample to an algorithm for computing monotone hulls of simple polygons. Pattern Recognit. Lett. 1(4): 219-222 (1983) - [j38]Godfried T. Toussaint, Binay K. Bhattacharya:
Optimal algorithms for computing the minimum distance between two finite planar sets. Pattern Recognit. Lett. 2(2): 79-82 (1983) - 1982
- [j36]Binay K. Bhattacharya, Godfried T. Toussaint:
A Counterexample to a Diameter Algorithm for Convex Polygons. IEEE Trans. Pattern Anal. Mach. Intell. 4(3): 306-309 (1982) - [j35]Godfried T. Toussaint, David Avis:
On a convex hull algorithm for polygons and its application to triangulation problems. Pattern Recognit. 15(1): 23-29 (1982) - 1981
- [j32]Luc Devroye, Godfried T. Toussaint:
A note on linear expected time algorithms for finding convex hulls. Computing 26(4): 361-366 (1981) - [j31]David Avis, Godfried T. Toussaint:
An efficient algorithm for decomposing a polygon into star-shaped polygons. Pattern Recognit. 13(6): 395-398 (1981) - [j30]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) - 1978
- [j25]Selim G. Akl, Godfried T. Toussaint:
An Improved Algorithm to Check for Polygon Similarity. Inf. Process. Lett. 7(3): 127-128 (1978) - [j24]Selim G. Akl, Godfried T. Toussaint:
A Fast Convex Hull Algorithm. Inf. Process. Lett. 7(5): 219-222 (1978)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-03 21:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
