A Fast Convex Hull Algorithm for Binary Image release_4emyjdnmc5ftbezcjpx3qv2w4e

by Xianquan Zhang, Zhenjun Tang, Jinhui Yu

Released as a article-journal .

2010   Volume 34


Convex hull is widely used in computer graphic, image processing, CAD/CAM and pattern recognition. In this work, we derive some new convex hull properties and then propose a fast algorithm based on these new properties to extract convex hull of the object in binary image. It is achieved by computing the extreme points, dividing the binary image into several regions, scanning the regions existing vertices dynamically, calculating the monotone segments, and merging these calculated segments. Theoretical analyses show that the proposed algorithm has low complexities of time and space. Povzetek: Predstavljen je nov algoritem za obdelavo binarnih slik.
In text/plain format

Archived Files and Locations

application/pdf  191.7 kB
web.archive.org (webarchive)
www.informatica.si (web)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   unknown
Year   2010
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 3cf6b3ae-c572-46da-81b4-4eea226ace84