### Abstract

The role of the convex hull in the field of pattern recognition is briefly reviewed. Two efficient algorithms for obtaining the convex hull of n points in the plane are proposed and their theoretical analyses presented. The first algorithm is applicable when the points are distinct, as in the pattern classification problem or the image processing problem in which the pattern is not connected. The algorithm has worst case complexity of 0(n log n), and an expected running time of 0(n). Experiments with the algorithm are described that confirm its intuitive and theoretical merits. The second algorithm is applicable for connected patterns.

Original language | English (US) |
---|---|

Pages | 483-487 |

Number of pages | 5 |

State | Published - Jan 1 1979 |

Event | Proc of the Int Jt Conf on Pattern Recognition, 4th - Kyoto, Jpn Duration: Nov 7 1978 → Nov 10 1978 |

### Other

Other | Proc of the Int Jt Conf on Pattern Recognition, 4th |
---|---|

City | Kyoto, Jpn |

Period | 11/7/78 → 11/10/78 |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*EFFICIENT CONVEX HULL ALGORITHMS FOR PATTERN RECOGNITION APPLICATIONS.*. 483-487. Paper presented at Proc of the Int Jt Conf on Pattern Recognition, 4th, Kyoto, Jpn, .

**EFFICIENT CONVEX HULL ALGORITHMS FOR PATTERN RECOGNITION APPLICATIONS.** / Akl, Selim G.; Toussaint, Godfried.

Research output: Contribution to conference › Paper

}

TY - CONF

T1 - EFFICIENT CONVEX HULL ALGORITHMS FOR PATTERN RECOGNITION APPLICATIONS.

AU - Akl, Selim G.

AU - Toussaint, Godfried

PY - 1979/1/1

Y1 - 1979/1/1

N2 - The role of the convex hull in the field of pattern recognition is briefly reviewed. Two efficient algorithms for obtaining the convex hull of n points in the plane are proposed and their theoretical analyses presented. The first algorithm is applicable when the points are distinct, as in the pattern classification problem or the image processing problem in which the pattern is not connected. The algorithm has worst case complexity of 0(n log n), and an expected running time of 0(n). Experiments with the algorithm are described that confirm its intuitive and theoretical merits. The second algorithm is applicable for connected patterns.

AB - The role of the convex hull in the field of pattern recognition is briefly reviewed. Two efficient algorithms for obtaining the convex hull of n points in the plane are proposed and their theoretical analyses presented. The first algorithm is applicable when the points are distinct, as in the pattern classification problem or the image processing problem in which the pattern is not connected. The algorithm has worst case complexity of 0(n log n), and an expected running time of 0(n). Experiments with the algorithm are described that confirm its intuitive and theoretical merits. The second algorithm is applicable for connected patterns.

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

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

M3 - Paper

AN - SCOPUS:0018295537

SP - 483

EP - 487

ER -