Godfried T. Toussaint

Inf. Process. Lett., 2007

Efficient Many-To-Many Point Matching in One Dimension.

[BibT_eX]

[DOI]

Graphs Comb., 2007

Deflating the Pentagon.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry and Graph Theory, 2007

An Experimental Comparison of Formal Measures of rhythmic Syncopation.

[BibT_eX]

[DOI]

Eric Thul

Proceedings of the 2007 International Computer Music Conference, 2007

Vertex Pops and Popturns.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

J. Comput. Biol., 2006

Algorithms for Computing Geometric Measures of Melodic Similarity.

[BibT_eX]

[DOI]

Yurai Núñez Rodríguez

Comput. Music. J., 2006

Polygons Flip Finitely: Flaws and a Fix.

[BibT_eX]

[DOI]

Erik D. Demaine

Blaise Gassend

Joseph O'Rourke

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

Curves in the Sand: Algorithmic Drawing.

[BibT_eX]

[DOI]

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005

An algorithm for computing the restriction scaffold assignment problem in computational biology.

[BibT_eX]

[DOI]

Justin Colannino

Inf. Process. Lett., 2005

Geometric proximity graphs for improving nearest neighbor methods in instance-based learning and data mining.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2005

Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2005

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

[BibT_eX]

[DOI]

CoRR, 2005

The Erdös-Nagy theorem and its ramifications .

[BibT_eX]

[DOI]

Comput. Geom., 2005

Geometric Decision Rules for Instance-Based Learning Problems.

[BibT_eX]

[DOI]

Kaustav Mukherjee

Proceedings of the Pattern Recognition and Machine Intelligence, 2005

Mathematical Features for Recognizing Preference in Sub-saharan African Traditional Rhythm Timelines.

[BibT_eX]

[DOI]

Proceedings of the Pattern Recognition and Data Mining, 2005

The Distance Geometry of Deep Rhythms and Scales.

[BibT_eX]

[DOI]

Erik D. Demaine

Francisco Gomez-Martin

Henk Meijer

Perouz Taslakian

Terry Winograd

David R. Wood

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

Pattern recognition.

[BibT_eX]

[DOI]

Joseph O'Rourke

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

Space-efficient planar convex hull algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Constructing convex 3-polytopes from two triangulations of a polygon.

[BibT_eX]

[DOI]

Benjamin M. Marlin

Comput. Geom., 2004

The Geometry of Musical Rhythm.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

A Comparison of Rhythmic Similarity Measures.

[BibT_eX]

[DOI]

Proceedings of the ISMIR 2004, 2004

Unfolding polyhedral bands.

[BibT_eX]

[DOI]

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

Simple Proofs of a Geometric Property of Four-Bar Linkages.

[BibT_eX]

[DOI]

Am. Math. Mon., 2003

Algorithms for bivariate medians and a Fermat-Torricelli problem for lines.

[BibT_eX]

[DOI]

Greg Aloupis

Stefan Langerman

Michael A. Soss

Comput. Geom., 2003

Geometric Graphs for Improving Nearest Neighbor Decision Rules.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2003

On Polyhedra Induced by Point Sets in Space.

[BibT_eX]

[DOI]

Joan Trias

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

Computing the Similarity of two Melodies.

[BibT_eX]

[DOI]

Yurai Núñez Rodríguez

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

On Computing General Position Views of Data in Three Dimensions.

[BibT_eX]

[DOI]

J. Vis. Commun. Image Represent., 2002

Aperture-Angle Optimization Problems in Three Dimensions.

[BibT_eX]

[DOI]

Elsa Omaña-Pulido

J. Math. Model. Algorithms, 2002

Implicit Convex Polygons.

[BibT_eX]

[DOI]

J. Math. Model. Algorithms, 2002

Finding Specified Sections of Arrangements: 2D Results.

[BibT_eX]

[DOI]

J. Math. Model. Algorithms, 2002

Flipturning Polygons.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2002

A note on reconfiguring tree linkages: trees can lock.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

Experimental results on quadrangulations of sets of fixed points.

[BibT_eX]

[DOI]

Alain Turki

Comput. Aided Geom. Des., 2002

Some Aperture-Angle Optimization Problems.

[BibT_eX]

[DOI]

Algorithmica, 2002

In-Place Planar Convex Hull Algorithms.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Open Problems in Geometric Methods for Instance-Based Learning.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

Flat-State Connectivity of Linkages under Dihedral Motions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

On flat-state connectivity of chains with fixed acute angles.

[BibT_eX]

[DOI]

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001

Nice Perspective Projections.

[BibT_eX]

[DOI]

J. Vis. Commun. Image Represent., 2001

Convexifying polygons with simple projections.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

Every Set of Disjoint Line Segments Admits a Binary Tree.

[BibT_eX]

[DOI]

Michael E. Houle

Discret. Comput. Geom., 2001

Locked and Unlocked Polygonal Chains in Three Dimensions.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2001

Reconfiguring convex polygons.

[BibT_eX]

[DOI]

Comput. Geom., 2001

1999

Drawing Nice Projections of Objects in Space.

[BibT_eX]

[DOI]

J. Vis. Commun. Image Represent., 1999

Computing a Shortest Weakly Externally Visible Line Segment for a Simple Polygon.

[BibT_eX]

[DOI]

Asish Mukhopadhyay

Int. J. Comput. Geom. Appl., 1999

Locked and Unlocked Polygonal Chains in 3D.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

Converting triangulations to quadrangulations.

[BibT_eX]

[DOI]

Pedro A. Ramos

Comput. Geom., 1998

Filling polyhedral molds.

[BibT_eX]

[DOI]

Marc J. van Kreveld

Comput. Aided Des., 1998

Aperture-angle optimization problems in 3 dimensions.

[BibT_eX]

[DOI]

Elsa Omaña-Pulido

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Constrainted facility location.

[BibT_eX]

[DOI]

Vera Sacristán

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Perspective projections and removal of degeneracies.

[BibT_eX]

[DOI]

Joan Antoni Sellarès

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Hiding disks in folded polygons.

[BibT_eX]

[DOI]

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

On reconfiguring tree linkages: Trees can lock.

[BibT_eX]

[DOI]

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997

Guarding Polyhedral Terrains.

[BibT_eX]

[DOI]

Thomas C. Shermer

Comput. Geom., 1997

Characterizing and efficiently computing quadrangulations of planar point sets.

[BibT_eX]

[DOI]

Comput. Aided Geom. Des., 1997

Feasibility of Design in Stereolithography.

[BibT_eX]

[DOI]

Gordon T. Wilfong

Algorithmica, 1997

On Removing Non-degeneracy Assumptions in Computational Geometry.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996

On Envelopes of Arrangements of Lines.

[BibT_eX]

[DOI]

David Eu

Eric Guévremont

J. Algorithms, 1996

All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers.

[BibT_eX]

[DOI]

David Bremner

Comput. Geom., 1996

On the Sectional Area of Convex Polytopes.

[BibT_eX]

[DOI]

Thomas C. Shermer

Jack Snoeyink

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Computing the Constrained Euclidean Geodesic and Link Center of a Simple Polygon with Application.

[BibT_eX]

[DOI]

Proceedings of the Computer Graphics International Conference, 1996

1995

Growing a Tree from Its Branches.

[BibT_eX]

[DOI]

J. Algorithms, 1995

Geometric and computational aspects of gravity casting.

[BibT_eX]

[DOI]

Comput. Aided Des., 1995

Quadrangulations of Planar Sets.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

No Quadrangulation is Extremely Odd.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Aperture angle optimization problems.

[BibT_eX]

[DOI]

Elsa Omaña-Pulido

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.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1994

Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-Complete.

[BibT_eX]

[DOI]

Chuzo Iwamoto

Inf. Process. Lett., 1994

On Approximating Polygonal Curves in Two and Three Dimensions.

[BibT_eX]

[DOI]

David Eu

CVGIP Graph. Model. Image Process., 1994

Linear Approximation of Simple Objects.

[BibT_eX]

[DOI]

Jean-Marc Robert

Comput. Geom., 1994

Geometric and computational aspects of manufacturing processes.

[BibT_eX]

[DOI]

Comput. Graph., 1994

1993

Slicing an ear using prune-and-search.

[BibT_eX]

[DOI]

Hazel Everett

Pattern Recognit. Lett., 1993

Convex Hulls for Random Lines.

[BibT_eX]

[DOI]

Luc Devroye

J. Algorithms, 1993

Feasability of Design in Stereolithography.

[BibT_eX]

[DOI]

Gordon T. Wilfong

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

Tetrahedralization of Simple and Non-Simple Polyhedra.

[BibT_eX]

Clark Verbrugge

Cao An Wang

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992

Relative neighborhood graphs and their relatives.

[BibT_eX]

[DOI]

Jerzy W. Jaromczyk

Proc. IEEE, 1992

Computing shortest transversals of sets.

[BibT_eX]

[DOI]

Jurek Czyzowicz

Peter Egyed

Ivan Stojmenovic

Jorge Urrutia

Int. J. Comput. Geom. Appl., 1992

1991

Efficient triangulation of simple polygons.

[BibT_eX]

[DOI]

Vis. Comput., 1991

A counterexample to a dynamic algorithm for convex hulls of line arrangements.

[BibT_eX]

[DOI]

Hazel Everett

Pattern Recognit. Lett., 1991

A counter-example to a convex hull algorithm for polygons.

[BibT_eX]

[DOI]

Pattern Recognit., 1991

Computing shortest transversals.

[BibT_eX]

[DOI]

Binay Bhattacharya

Computing, 1991

A Linear Time Algorithm for Computing the Shortest Line Segment from Which a Polygon is Weakly Externally Visible.

[BibT_eX]

[DOI]

Asish Mukhopadhyay

Proceedings of the Algorithms and Data Structures, 1991

The Aquarium Keeper's Problem.

[BibT_eX]

[DOI]

Jorge Urrutia

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Computing Shortest Transversals of Sets (Extended Abstract).

[BibT_eX]

[DOI]

Jurek Czyzowicz

Peter Egyed

Ivan Stojmenovic

Jorge Urrutia

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990

The Graham scan triangulates simple polygons.

[BibT_eX]

[DOI]

Xianshu Kong

Hazel Everett

Pattern Recognit. Lett., 1990

Computing Simple Circuits form a Set of Line Segments.

[BibT_eX]

[DOI]

Hiroshi Imai

Discret. Comput. Geom., 1990

Computing the external geodesic diameter of a simple polygon.

[BibT_eX]

[DOI]

David Samuel

Computing, 1990

1989

On geodesic properties of polygons relevant to linear time triangulation.

[BibT_eX]

[DOI]

Vis. Comput., 1989

On Seperating Two Simple Polygons by a Single Translation.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1989

Determining Sector Visibility of a Polygon.

[BibT_eX]

[DOI]

David G. Kirkpatrick

Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988

Fast algorithms for computing the diameter of a finite planar set.

[BibT_eX]

[DOI]

Vis. Comput., 1988

Computing the Width of a Set.

[BibT_eX]

[DOI]

Michael E. Houle

IEEE Trans. Pattern Anal. Mach. Intell., 1988

Computing the Link Center of a Simple Polygon.

[BibT_eX]

[DOI]

Chee-Keng Yap

Discret. Comput. Geom., 1988

1987

Separability of pairs of polygons through single translations.

[BibT_eX]

[DOI]

Jörg-Rüdiger Sack

Robotica, 1987

Bayes classification rule for the general discrete case.

[BibT_eX]

[DOI]

Pattern Recognit., 1987

1986

Visibility between two edges of a simple polygon.

[BibT_eX]

[DOI]

Teren Gum

Vis. Comput., 1986

A linear-time algorithm for solving the strong hidden-line problem in a simple polygon.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1986

Shortest path solves edge-to-edge visibility in a polygon.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1986

Shortest Path Solves Translation Separability of Polygons.

[BibT_eX]

Proceedings of the Intelligent Autonomous Systems, 1986

On Computing Simple Circuits on a Set of Line Segments.

[BibT_eX]

[DOI]

Hiroshi Imai

Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985

A simple linear algorithm for intersecting convex polygons.

[BibT_eX]

[DOI]

Vis. Comput., 1985

A historical note on convex hull finding algorithms.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1985

A simple linear hidden-line algorithm for star-shaped polygons.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1985

On the ultimate convex hull algorithm in practice.

[BibT_eX]

[DOI]

Mary M. McQueen

Pattern Recognit. Lett., 1985

Translating Polygons in the Plane.

[BibT_eX]

[DOI]

Jörg-Rüdiger Sack

Proceedings of the STACS 85, 1985

On Computing and Updating Triangulations.

[BibT_eX]

Proceedings of the Foundations of Data Organization, 1985

Computating the width of a set.

[BibT_eX]

[DOI]

Michael E. Houle

Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984

Separation of two monotone polygons in linear time.

[BibT_eX]

[DOI]

Robotica, 1984

A new linear algorithm for triangulating monotone polygons.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1984

Complexity, convexity, and unimodality.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 1984

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

[BibT_eX]

[DOI]

Computing, 1984

1983

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

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1983

A counterexample to an algorithm for computing monotone hulls of simple polygons.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1983

Optimal algorithms for computing the minimum distance between two finite planar sets.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1983

On the application of the convex hull to histogram analysis in threshold selection.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1983

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

[BibT_eX]

[DOI]

J. Algorithms, 1983

Time- and storage-efficient implementation of an optimal planar convex hull algorithm.

[BibT_eX]

[DOI]

Image Vis. Comput., 1983

Computing largest empty circles with location constraints.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 1983

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

[BibT_eX]

[DOI]

Computing, 1983

1982

A simple O(n log n) algorithm for finding the maximum distance between two finite planar sets.

[BibT_eX]

[DOI]

Jim A. McAlear

Pattern Recognit. Lett., 1982

A simple proof of Pach's extremal theorem for convex polygons.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1982

On a convex hull algorithm for polygons and its application to triangulation problems.

[BibT_eX]

[DOI]

Pattern Recognit., 1982

A Counterexample to a Diameter Algorithm for Convex Polygons.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 1982

1981

An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1981

An efficient algorithm for decomposing a polygon into star-shaped polygons.

[BibT_eX]

[DOI]

Pattern Recognit., 1981

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

[BibT_eX]

[DOI]

Luc Devroye

Computing, 1981

1980

The relative neighbourhood graph of a finite planar set.

[BibT_eX]

[DOI]

Pattern Recognit., 1980

The Sensitivity of the Modified Viterbi Algorithm to the Source Statistics.

[BibT_eX]

[DOI]

Rajjan Shinghal

IEEE Trans. Pattern Anal. Mach. Intell., 1980

1979

Classification of atypical cells in the automatic cytoscreening for cervical cancer.

[BibT_eX]

[DOI]

Lawrence H. Oliver

Ronald S. Poulsen

C. Louis

Pattern Recognit., 1979

Experiments in Text Recognition with the Modified Viterbi Algorithm.

[BibT_eX]

[DOI]

Rajjan Shinghal

IEEE Trans. Pattern Anal. Mach. Intell., 1979

Some new algorithms and software implementation methods for pattern recognition research part II. software implementation methods.

[BibT_eX]

[DOI]

Ron S. Foulsen

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.

[BibT_eX]

[DOI]

Ron S. Foulsen

Proceedings of the IEEE Computer Society's Third International Computer Software and Applications Conference, 1979

1978

The use of context in pattern recognition.

[BibT_eX]

[DOI]

Pattern Recognit., 1978

A Fast Convex Hull Algorithm.

[BibT_eX]

[DOI]

Selim G. Akl

Inf. Process. Lett., 1978

An Improved Algorithm to Check for Polygon Similarity.

[BibT_eX]

[DOI]

Selim G. Akl

Inf. Process. Lett., 1978

1977

On the detection of structures in noisy pictures.

[BibT_eX]

[DOI]

Melvin Cohen

Pattern Recognit., 1977

A Simplified Heuristic Version of Raviv's Algorithm for Using Context in Text Recognition.

[BibT_eX]

[DOI]

R. Schinghal

D. Rosenberg

Proceedings of the 5th International Joint Conference on Artificial Intelligence. Cambridge, 1977

1975

Sharper lower bounds for discrimination information in terms of variation (Corresp.).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1975

Comments on "On a New Class of Bounds on Bayes' Risk in Multihypothesis Pattern Recognition".

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1975

Subjective clustering and bibliography of books on pattern recognition.

[BibT_eX]

[DOI]

Inf. Sci., 1975

1974

Bibliography on estimation of misclassification.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1974

Comments on "The Extraction of Pattern Features from Imperfectly Identified Samples".

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1974

1972

Comments on "The Divergence and Bhattacharyya Distance Measures in Signal Selection".

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1972

Comments on "Feature Selection with a Linear Dependence Measure".

[BibT_eX]

[DOI]

Toomas R. Vilmansen

IEEE Trans. Computers, 1972

Comments on "A Comparison of Seven Techniques for Choosing Subsets of Pattern Recognition Properties".

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1972

Comments on "Error Bounds for a Contextual Recognition Procedure".

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1972

Comments on "Theoretical Comparison of a Class of Feature Selection Criteria in Pattern Recognition".

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1972

Some Inequalities Between Distance Measures for Feature Evaluation.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1972

Polynomial Representation of Classifiers with Independent Discrete-Valued Features.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1972

Results Obtained Using a Simple Character Recognition Procedure on Munson's Handprinted Data.

[BibT_eX]

[DOI]

A. B. Shahidul Hussain

Robert W. Donaldson

IEEE Trans. Computers, 1972

Feature Evaluation with Quadratic Mutual Information.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1972

1971

Comments on "A Dynamic Programming Approach to the Selection of Pattern Features".

[BibT_eX]

[DOI]

A. B. Shahidul Hussain

IEEE Trans. Syst. Man Cybern., 1971

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

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1971

Note on optimal selection of independent binary-valued features for pattern recognition (Corresp.).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1971

Some Upper Bounds on Error Probability for Multiclass Pattern Recognition.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1971

1970

On a Simple Minkowski Metric Classifier.

[BibT_eX]

[DOI]

IEEE Trans. Syst. Sci. Cybern., 1970

Algorithms for Recognizing Contour-Traced Handprinted Characters.

[BibT_eX]

[DOI]

Robert W. Donaldson

IEEE Trans. Computers, 1970

Use of Contextual Constraints in Recognition of Contour-Traced Handprinted Characters.

[BibT_eX]

[DOI]

Robert W. Donaldson