EFFICIENT CONVEX HULL ALGORITHMS FOR PATTERN RECOGNITION APPLICATIONS.

Selim G. Akl, Godfried T. Toussaint

Research output: Contribution to conferencePaperpeer-review

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 languageEnglish (US)
Pages483-487
Number of pages5
StatePublished - 1979
EventProc of the Int Jt Conf on Pattern Recognition, 4th - Kyoto, Jpn
Duration: Nov 7 1978Nov 10 1978

Other

OtherProc of the Int Jt Conf on Pattern Recognition, 4th
CityKyoto, Jpn
Period11/7/7811/10/78

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'EFFICIENT CONVEX HULL ALGORITHMS FOR PATTERN RECOGNITION APPLICATIONS.'. Together they form a unique fingerprint.

Cite this