PATTERN RECOGNITION AND GEOMETRICAL COMPLEXITY.

Research output: Contribution to conferencePaper

Abstract

A survey is presented of some of the geometrical structures, and associated computational complexity, that have very recently been used to find elegant solutions to various pattern recognition problems. Such structures include: the diameter of a set, the convex hull, the relative neighborhood graph, the Gabriel graph, the Delaunay triangulation, the 3-coloring of a triangulation, and the Voronoi diagram. Each of these structures can be applied to one or several problems. This study surveys some of the most recent results concerning efficient algorithms for computing these structures as well as the inherent complexity of the problems themselves.

Original languageEnglish (US)
Pages1324-1347
Number of pages24
StatePublished - Jan 1 1980
EventUnknown conference - Miami Beach, FL, USA
Duration: Dec 1 1980Dec 4 1980

Other

OtherUnknown conference
CityMiami Beach, FL, USA
Period12/1/8012/4/80

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Toussaint, G. T. (1980). PATTERN RECOGNITION AND GEOMETRICAL COMPLEXITY.. 1324-1347. Paper presented at Unknown conference, Miami Beach, FL, USA, .