Computational geometric problems in pattern recognition.

G. T. Toussaint

doi:10.1007/978-94-009-7772-3_7

Computational geometric problems in pattern recognition.

G. T. Toussaint

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

Surveys recent results in the design and analysis of algorithms for solving geometric problems in pattern recognition. Among the problems considered are: the convex hull, the diameter, Voronoi diagrams, the relative neighbourhood graph, polygon decomposition, and distance between sets.-from Author

Original language	English (US)
Pages (from-to)	73-91
Number of pages	19
Journal	Unknown Journal
DOIs	https://doi.org/10.1007/978-94-009-7772-3_7
State	Published - 1982

ASJC Scopus subject areas

General Environmental Science
General Earth and Planetary Sciences

Access to Document

10.1007/978-94-009-7772-3_7

Cite this

@article{4790cdbc6da44a25bc477103de6f4656,

title = "Computational geometric problems in pattern recognition.",

abstract = "Surveys recent results in the design and analysis of algorithms for solving geometric problems in pattern recognition. Among the problems considered are: the convex hull, the diameter, Voronoi diagrams, the relative neighbourhood graph, polygon decomposition, and distance between sets.-from Author",

author = "Toussaint, {G. T.}",

year = "1982",

doi = "10.1007/978-94-009-7772-3_7",

language = "English (US)",

pages = "73--91",

journal = "Unknown Journal",

issn = "0304-3975",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Computational geometric problems in pattern recognition.

AU - Toussaint, G. T.

PY - 1982

Y1 - 1982

N2 - Surveys recent results in the design and analysis of algorithms for solving geometric problems in pattern recognition. Among the problems considered are: the convex hull, the diameter, Voronoi diagrams, the relative neighbourhood graph, polygon decomposition, and distance between sets.-from Author

AB - Surveys recent results in the design and analysis of algorithms for solving geometric problems in pattern recognition. Among the problems considered are: the convex hull, the diameter, Voronoi diagrams, the relative neighbourhood graph, polygon decomposition, and distance between sets.-from Author

UR - http://www.scopus.com/inward/record.url?scp=0020428412&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020428412&partnerID=8YFLogxK

U2 - 10.1007/978-94-009-7772-3_7

DO - 10.1007/978-94-009-7772-3_7

M3 - Article

AN - SCOPUS:0020428412

SN - 0304-3975

SP - 73

EP - 91

JO - Unknown Journal

JF - Unknown Journal

ER -

Computational geometric problems in pattern recognition.

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this