A Fast Convex Hull Algorithm for Binary Image

Abstract

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.

Extracted Key Phrases

2 Figures and Tables

050100150201220132014201520162017
Citations per Year

146 Citations

Semantic Scholar estimates that this publication has 146 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Zhang2010AFC, title={A Fast Convex Hull Algorithm for Binary Image}, author={Xianquan Zhang and Zhenjun Tang and Jinhui Yu and Mingming Guo}, journal={Informatica (Slovenia)}, year={2010}, volume={34}, pages={369-376} }