Please use this identifier to cite or link to this item:
|Title:||A fast algorithm for convex hull extraction in 2D images||Authors:||Ye, Q.-Z.||Keywords:||Convex hull
Convex hull algorithm
|Issue Date:||May-1995||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.||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.||Source Title:||Pattern Recognition Letters||URI:||http://scholarbank.nus.edu.sg/handle/10635/54120||ISSN:||01678655|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 18, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.