Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/54120
DC FieldValue
dc.titleA fast algorithm for convex hull extraction in 2D images
dc.contributor.authorYe, Q.-Z.
dc.date.accessioned2014-06-16T09:27:28Z
dc.date.available2014-06-16T09:27:28Z
dc.date.issued1995-05
dc.identifier.citationYe, Q.-Z. (1995-05). A fast algorithm for convex hull extraction in 2D images. Pattern Recognition Letters 16 (5) : 531-537. ScholarBank@NUS Repository.
dc.identifier.issn01678655
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/54120
dc.description.abstractA fast algorithm for computing the convex hull of a set of distinct points or an arbitrarily shaped object in the Cartesian discrete plane is presented in this paper. A sequence of points is first extracted from the input image. These points form a non-self-intersecting polygon. Then, a cross-product rule is used to check the convexity of the polygon and compute the convex hull from it. © 1995.
dc.sourceScopus
dc.subjectConvex hull
dc.subjectConvex hull algorithm
dc.typeArticle
dc.contributor.departmentELECTRICAL ENGINEERING
dc.description.sourcetitlePattern Recognition Letters
dc.description.volume16
dc.description.issue5
dc.description.page531-537
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.