Godfried T. Toussaint

According to our database1, Godfried T. Toussaint
  • authored at least 207 papers between 1970 and 2018.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane.
Comp. Opt. and Appl., 2018

2017
A Novel Approach for Ellipsoidal Outer-Approximation of the Intersection Region of Ellipses in the Plane.
CoRR, 2017

Robust Dictionary Lookup in Multiple Noisy Orthographies.
Proceedings of the Third Arabic Natural Language Processing Workshop, 2017

2015
Measuring Musical Rhythm Similarity: Statistical Features Versus Transformation Methods.
IJPRAI, 2015

Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences.
Graphs and Combinatorics, 2015

Measuring the complexity of two-dimensional binary patterns - Sub-symmetries versus Papentin complexity.
Proceedings of the 14th IAPR International Conference on Machine Vision Applications, 2015

A Dissimilarity Measure for Comparing Origami Crease Patterns.
Proceedings of the ICPRAM 2015, 2015

2014
An Empirical Comparison of Support Vector Machines Versus Nearest Neighbour Methods for Machine Learning Applications.
Proceedings of the Pattern Recognition Applications and Methods, 2014

Speeding up Support Vector Machines - Probabilistic versus Nearest Neighbour Methods for Condensing Training Data.
Proceedings of the ICPRAM 2014, 2014

2013
Bounded-degree polyhedronization of point sets.
Comput. Geom., 2013

Measuring Irregularity in Symbolic Spike Trains: Application to Steve Reich's Clapping Music.
Proceedings of the Advances in Data Mining, 13th Industrial Conference, 2013

Measuring Musical Rhythm Similarity - Statistical Features versus Transformation Methods.
Proceedings of the ICPRAM 2013, 2013

2012
Proximity-Graph Instance-Based Learning, Support Vector Machines, and High Dimensionality: An Empirical Comparison.
Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2012

2011
Computing Signed Permutations of Polygons.
Int. J. Comput. Geometry Appl., 2011

Open Guard Edges and Edge Guards in Simple Polygons.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Edge-guarding Orthogonal Polyhedra.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Open Guard Edges and Edge Guards in Simple Polygons.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Minimum Many to Many Matchings for Computing the Distance Between Two Sequences.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Computational geometric aspects of rhythm, melody, and voice-leading.
Comput. Geom., 2010

Bounded-degree polyhedronization of point sets.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009
Proximity-Graph-Based Tools for DNA Clustering.
Proceedings of the Encyclopedia of Data Warehousing and Mining, Second Edition (4 Volumes), 2009

The distance geometry of music.
Comput. Geom., 2009

2008
On polyhedra induced by point sets in space.
Discrete Applied Mathematics, 2008

Cauchy's Arm Lemma on a Growing Sphere
CoRR, 2008

Edge-unfolding nested polyhedral bands.
Comput. Geom., 2008

Rhythm Complexity Measures: A Comparison of Mathematical Models of Human Perception and Performance.
Proceedings of the ISMIR 2008, 2008

A Pumping Lemma for Homometric Rhythms.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

On the relation between rhythm complexity measures and human rhythmic performance.
Proceedings of the Canadian Conference on Computer Science & Software Engineering, 2008

Analysis of musical rhythm complexity measures in a cultural context.
Proceedings of the Canadian Conference on Computer Science & Software Engineering, 2008

Evenness preserving operations on musical rhythms.
Proceedings of the Canadian Conference on Computer Science & Software Engineering, 2008

2007
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., 2007

Efficient Many-To-Many Point Matching in One Dimension.
Graphs and Combinatorics, 2007

The Distance Geometry of Music
CoRR, 2007

Deflating the Pentagon.
Proceedings of the Computational Geometry and Graph Theory, 2007

An Experimental Comparison of Formal Measures of rhythmic Syncopation.
Proceedings of the 2007 International Computer Music Conference, 2007

Vertex Pops and Popturns.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
An O(n log n)-Time Algorithm for the Restriction Scaffold Assignment Problem.
Journal of Computational Biology, 2006

Algorithms for Computing Geometric Measures of Melodic Similarity.
Computer Music Journal, 2006

Polygons Flip Finitely: Flaws and a Fix.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

Curves in the Sand: Algorithmic Drawing.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005
An algorithm for computing the restriction scaffold assignment problem in computational biology.
Inf. Process. Lett., 2005

Geometric proximity graphs for improving nearest neighbor methods in instance-based learning and data mining.
Int. J. Comput. Geometry Appl., 2005

Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries.
Discrete & Computational Geometry, 2005

An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment
CoRR, 2005

The Erdös-Nagy theorem and its ramifications .
Comput. Geom., 2005

Geometric Decision Rules for Instance-Based Learning Problems.
Proceedings of the Pattern Recognition and Machine Intelligence, 2005

Mathematical Features for Recognizing Preference in Sub-saharan African Traditional Rhythm Timelines.
Proceedings of the Pattern Recognition and Data Mining, 2005

The Distance Geometry of Deep Rhythms and Scales.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
Pattern recognition.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Space-efficient planar convex hull algorithms.
Theor. Comput. Sci., 2004

Constructing convex 3-polytopes from two triangulations of a polygon.
Comput. Geom., 2004

The Geometry of Musical Rhythm.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

A Comparison of Rhythmic Similarity Measures.
Proceedings of the ISMIR 2004, 2004

Unfolding polyhedral bands.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003
Simple Proofs of a Geometric Property of Four-Bar Linkages.
The American Mathematical Monthly, 2003

Algorithms for bivariate medians and a Fermat-Torricelli problem for lines.
Comput. Geom., 2003

Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Geometric Graphs for Improving Nearest Neighbor Decision Rules.
Proceedings of the Computational Science and Its Applications, 2003

On Polyhedra Induced by Point Sets in Space.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

Computing the Similarity of two Melodies.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
On Computing General Position Views of Data in Three Dimensions.
J. Visual Communication and Image Representation, 2002

Aperture-Angle Optimization Problems in Three Dimensions.
J. Math. Model. Algorithms, 2002

Implicit Convex Polygons.
J. Math. Model. Algorithms, 2002

Finding Specified Sections of Arrangements: 2D Results.
J. Math. Model. Algorithms, 2002

A note on reconfiguring tree linkages: trees can lock.
Discrete Applied Mathematics, 2002

Experimental results on quadrangulations of sets of fixed points.
Computer Aided Geometric Design, 2002

Some Aperture-Angle Optimization Problems.
Algorithmica, 2002

In-Place Planar Convex Hull Algorithms.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Open Problems in Geometric Methods for Instance-Based Learning.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

Flat-State Connectivity of Linkages under Dihedral Motions.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Constructing convex 3-polytopes from two triangulations of a polygon.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

On flat-state connectivity of chains with fixed acute angles.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

Computing signed permutations of polygons.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
Nice Perspective Projections.
J. Visual Communication and Image Representation, 2001

Convexifying polygons with simple projections.
Inf. Process. Lett., 2001

Every Set of Disjoint Line Segments Admits a Binary Tree.
Discrete & Computational Geometry, 2001

Locked and Unlocked Polygonal Chains in Three Dimensions.
Discrete & Computational Geometry, 2001

Reconfiguring convex polygons.
Comput. Geom., 2001

Algorithms for bivariate medians and a fermat-torricelli problem for lines.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000
Flipturning polygons
CoRR, 2000

Reconfiguring Convex Polygons.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999
Drawing Nice Projections of Objects in Space.
J. Visual Communication and Image Representation, 1999

Computing a Shortest Weakly Externally Visible Line Segment for a Simple Polygon.
Int. J. Comput. Geometry Appl., 1999

On Reconfiguring Tree Linkages: Trees can Lock
CoRR, 1999

Locked and Unlocked Polygonal Chains in 3D
CoRR, 1999

Locked and Unlocked Polygonal Chains in 3D.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

The Erdös-Nagy theorem and its ramifications.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998
Locked and Unlocked Polygonal Chains in 3D
CoRR, 1998

Converting triangulations to quadrangulations.
Comput. Geom., 1998

Filling polyhedral molds.
Computer-Aided Design, 1998

Aperture-angle optimization problems in 3 dimensions.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Constrainted facility location.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Perspective projections and removal of degeneracies.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Finding specified sections of arrangements: 2d results.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Hiding disks in folded polygons.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

On reconfiguring tree linkages: Trees can lock.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
Guarding Polyhedral Terrains.
Comput. Geom., 1997

Characterizing and efficiently computing quadrangulations of planar point sets.
Computer Aided Geometric Design, 1997

Feasibility of Design in Stereolithography.
Algorithmica, 1997

On Removing Non-degeneracy Assumptions in Computational Geometry.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996
On Envelopes of Arrangements of Lines.
J. Algorithms, 1996

All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers.
Comput. Geom., 1996

On the Sectional Area of Convex Polytopes.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Computing the Constrained Euclidean Geodesic and Link Center of a Simple Polygon with Application.
Proceedings of the Computer Graphics International Conference, 1996

1995
Growing a Tree from Its Branches.
J. Algorithms, 1995

Geometric and computational aspects of gravity casting.
Computer-Aided Design, 1995

Quadrangulations of Planar Sets.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

No Quadrangulation is Extremely Odd.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Drawing Nice Projections of Objects in Space.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, GD '95, Passau, 1995

Aperture angle optimization problems.
Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994
A counterexample to Tomek's consistency theorem for a condensed nearest neighbor decision rule.
Pattern Recognition Letters, 1994

Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-Complete.
Inf. Process. Lett., 1994

On Approximating Polygonal Curves in Two and Three Dimensions.
CVGIP: Graphical Model and Image Processing, 1994

Linear Approximation of Simple Objects.
Comput. Geom., 1994

Geometric and computational aspects of manufacturing processes.
Computers & Graphics, 1994

Every Set of Disjoint Line Segments Admits a Binary Tree.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-complete.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

All Convex Polyhedra can be Clamped with Parallel Jaw Grippers.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993
Slicing an ear using prune-and-search.
Pattern Recognition Letters, 1993

Convex Hulls for Random Lines.
J. Algorithms, 1993

Filling Polyhedral Molds.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Feasability of Design in Stereolithography.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

Tetrahedralization of Simple and Non-Simple Polyhedra.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992
Computing shortest transversals of sets.
Int. J. Comput. Geometry Appl., 1992

Linear Approximation of Simple Objects.
Proceedings of the STACS 92, 1992

1991
Efficient triangulation of simple polygons.
The Visual Computer, 1991

A counterexample to a dynamic algorithm for convex hulls of line arrangements.
Pattern Recognition Letters, 1991

A counter-example to a convex hull algorithm for polygons.
Pattern Recognition, 1991

Computing shortest transversals.
Computing, 1991

A Linear Time Algorithm for Computing the Shortest Line Segment from Which a Polygon is Weakly Externally Visible.
Proceedings of the Algorithms and Data Structures, 1991

The Aquarium Keeper's Problem.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Computing Shortest Transversals.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

Computing Shortest Transversals of Sets (Extended Abstract).
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990
The Graham scan triangulates simple polygons.
Pattern Recognition Letters, 1990

Computing Simple Circuits form a Set of Line Segments.
Discrete & Computational Geometry, 1990

Computing the external geodesic diameter of a simple polygon.
Computing, 1990

1989
On geodesic properties of polygons relevant to linear time triangulation.
The Visual Computer, 1989

On Seperating Two Simple Polygons by a Single Translation.
Discrete & Computational Geometry, 1989

Determining Sector Visibility of a Polygon.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988
Fast algorithms for computing the diameter of a finite planar set.
The Visual Computer, 1988

Computing the Width of a Set.
IEEE Trans. Pattern Anal. Mach. Intell., 1988

Computing the Link Center of a Simple Polygon.
Discrete & Computational Geometry, 1988

1987
Separability of pairs of polygons through single translations.
Robotica, 1987

Bayes classification rule for the general discrete case.
Pattern Recognition, 1987

Computing the Link Center of a Simple Polygon.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986
Visibility between two edges of a simple polygon.
The Visual Computer, 1986

A linear-time algorithm for solving the strong hidden-line problem in a simple polygon.
Pattern Recognition Letters, 1986

Shortest path solves edge-to-edge visibility in a polygon.
Pattern Recognition Letters, 1986

Shortest Path Solves Translation Separability of Polygons.
Proceedings of the Intelligent Autonomous Systems, 1986

On Computing Simple Circuits on a Set of Line Segments.
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985
A simple linear algorithm for intersecting convex polygons.
The Visual Computer, 1985

A historical note on convex hull finding algorithms.
Pattern Recognition Letters, 1985

A simple linear hidden-line algorithm for star-shaped polygons.
Pattern Recognition Letters, 1985

On the ultimate convex hull algorithm in practice.
Pattern Recognition Letters, 1985

Translating Polygons in the Plane.
Proceedings of the STACS 85, 1985

On Computing and Updating Triangulations.
FODO, 1985

Computating the width of a set.
Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984
Separation of two monotone polygons in linear time.
Robotica, 1984

A new linear algorithm for triangulating monotone polygons.
Pattern Recognition Letters, 1984

Complexity, convexity, and unimodality.
International Journal of Parallel Programming, 1984

An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons.
Computing, 1984

1983
Review of 'Progress in Pattern Recognition' (Kanal, L.N., and Rosenfeld, A., Eds.; 1981).
IEEE Trans. Information Theory, 1983

A counterexample to an algorithm for computing monotone hulls of simple polygons.
Pattern Recognition Letters, 1983

Optimal algorithms for computing the minimum distance between two finite planar sets.
Pattern Recognition Letters, 1983

On the application of the convex hull to histogram analysis in threshold selection.
Pattern Recognition Letters, 1983

Efficient Algorithms for Computing the Maximum Distance Between Two Finite Planar Sets.
J. Algorithms, 1983

Time- and storage-efficient implementation of an optimal planar convex hull algorithm.
Image Vision Comput., 1983

Computing largest empty circles with location constraints.
International Journal of Parallel Programming, 1983

Applications of a two-dimensional hidden-line algorithm to other geometric problems.
Computing, 1983

1982
A simple O(n log n) algorithm for finding the maximum distance between two finite planar sets.
Pattern Recognition Letters, 1982

A simple proof of Pach's extremal theorem for convex polygons.
Pattern Recognition Letters, 1982

On a convex hull algorithm for polygons and its application to triangulation problems.
Pattern Recognition, 1982

A Counterexample to a Diameter Algorithm for Convex Polygons.
IEEE Trans. Pattern Anal. Mach. Intell., 1982

1981
An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge.
IEEE Trans. Computers, 1981

An efficient algorithm for decomposing a polygon into star-shaped polygons.
Pattern Recognition, 1981

A note on linear expected time algorithms for finding convex hulls.
Computing, 1981

1980
The relative neighbourhood graph of a finite planar set.
Pattern Recognition, 1980

The Sensitivity of the Modified Viterbi Algorithm to the Source Statistics.
IEEE Trans. Pattern Anal. Mach. Intell., 1980

1979
Classification of atypical cells in the automatic cytoscreening for cervical cancer.
Pattern Recognition, 1979

Experiments in Text Recognition with the Modified Viterbi Algorithm.
IEEE Trans. Pattern Anal. Mach. Intell., 1979

Some new algorithms and software implementation methods for pattern recognition research part II. software implementation methods.
Proceedings of the IEEE Computer Society's Third International Computer Software and Applications Conference, 1979

Some new algorithms and software implementation methods for pattern recognition research.
Proceedings of the IEEE Computer Society's Third International Computer Software and Applications Conference, 1979

1978
The use of context in pattern recognition.
Pattern Recognition, 1978

A Fast Convex Hull Algorithm.
Inf. Process. Lett., 1978

An Improved Algorithm to Check for Polygon Similarity.
Inf. Process. Lett., 1978

1977
On the detection of structures in noisy pictures.
Pattern Recognition, 1977

A Simplified Heuristic Version of Raviv's Algorithm for Using Context in Text Recognition.
Proceedings of the 5th International Joint Conference on Artificial Intelligence. Cambridge, 1977

1975
Sharper lower bounds for discrimination information in terms of variation (Corresp.).
IEEE Trans. Information Theory, 1975

Comments on "On a New Class of Bounds on Bayes' Risk in Multihypothesis Pattern Recognition".
IEEE Trans. Computers, 1975

Subjective clustering and bibliography of books on pattern recognition.
Inf. Sci., 1975

1974
Bibliography on estimation of misclassification.
IEEE Trans. Information Theory, 1974

Comments on "The Extraction of Pattern Features from Imperfectly Identified Samples".
IEEE Trans. Computers, 1974

1972
Comments on "Feature Selection with a Linear Dependence Measure".
IEEE Trans. Computers, 1972

Comments on "A Comparison of Seven Techniques for Choosing Subsets of Pattern Recognition Properties".
IEEE Trans. Computers, 1972

Comments on "Error Bounds for a Contextual Recognition Procedure".
IEEE Trans. Computers, 1972

Comments on "Theoretical Comparison of a Class of Feature Selection Criteria in Pattern Recognition".
IEEE Trans. Computers, 1972

Some Inequalities Between Distance Measures for Feature Evaluation.
IEEE Trans. Computers, 1972

Polynomial Representation of Classifiers with Independent Discrete-Valued Features.
IEEE Trans. Computers, 1972

Results Obtained Using a Simple Character Recognition Procedure on Munson's Handprinted Data.
IEEE Trans. Computers, 1972

Feature Evaluation with Quadratic Mutual Information.
Inf. Process. Lett., 1972

1971
Comments on "A Dynamic Programming Approach to the Selection of Pattern Features".
IEEE Trans. Systems, Man, and Cybernetics, 1971

Comments on 'A modified figure of merit for feature selection in pattern recognition' by Paul, J. E., Jr., et al.
IEEE Trans. Information Theory, 1971

Note on optimal selection of independent binary-valued features for pattern recognition (Corresp.).
IEEE Trans. Information Theory, 1971

Some Upper Bounds on Error Probability for Multiclass Pattern Recognition.
IEEE Trans. Computers, 1971

1970
On a Simple Minkowski Metric Classifier.
IEEE Trans. Systems Science and Cybernetics, 1970

Algorithms for Recognizing Contour-Traced Handprinted Characters.
IEEE Trans. Computers, 1970

Use of Contextual Constraints in Recognition of Contour-Traced Handprinted Characters.
IEEE Trans. Computers, 1970


  Loading...