Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/54120
DC Field | Value | |
---|---|---|
dc.title | A fast algorithm for convex hull extraction in 2D images | |
dc.contributor.author | Ye, Q.-Z. | |
dc.date.accessioned | 2014-06-16T09:27:28Z | |
dc.date.available | 2014-06-16T09:27:28Z | |
dc.date.issued | 1995-05 | |
dc.identifier.citation | Ye, 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.issn | 01678655 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/54120 | |
dc.description.abstract | A 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.source | Scopus | |
dc.subject | Convex hull | |
dc.subject | Convex hull algorithm | |
dc.type | Article | |
dc.contributor.department | ELECTRICAL ENGINEERING | |
dc.description.sourcetitle | Pattern Recognition Letters | |
dc.description.volume | 16 | |
dc.description.issue | 5 | |
dc.description.page | 531-537 | |
dc.identifier.isiut | NOT_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.