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 language | English (US) |
|---|---|
| Pages | 1324-1347 |
| Number of pages | 24 |
| State | Published - 1980 |
| Event | Unknown conference - Miami Beach, FL, USA Duration: Dec 1 1980 → Dec 4 1980 |
Other
| Other | Unknown conference |
|---|---|
| City | Miami Beach, FL, USA |
| Period | 12/1/80 → 12/4/80 |
ASJC Scopus subject areas
- General Engineering