A fast convex hull algorithm for binary image

Informatica (Ljubljana)

Volumn 34, Issue 3, 2010, Pages 369-376

  Zhang, Xianquan ^a   Tang, Zhenjun ^a   Yu, Jinhui ^b   Guo, Mingming ^a  

^a GUANGXI NORMAL UNIVERSITY   (China)

^b ZHEJIANG UNIVERSITY   (China)

Author keywords

Computational geometry; Convex hull; Extreme point; Monotone segment; Point set

Indexed keywords

CAD/CAMS; CONVEX HULL; CONVEX HULL ALGORITHM; EXTREME POINTS; FAST ALGORITHMS; LOW COMPLEXITY; MONOTONE SEGMENT; POINT SET; TIME AND SPACE;

ALGORITHMS; BINARY IMAGES; PATTERN RECOGNITION;

COMPUTATIONAL GEOMETRY;

EID: 78649293942     PISSN: 03505596     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. Bhaniramka P., Wenger, R., and Crawfis, R. (2004) Isosurface construction in any dimension using convex hulls. IEEE Transactions on Visualization and Computer Graphics, vol.10, no.2, pp.130-141.
2. Yuan B., and Tan C. L. (2007). Convex hull based skew estimation. Pattern Recognition, vol.40, no.2, pp.456-475.
3. Nikolay M. Sirakov et al. (2004). Search space partitioning using convex hull and concavity features for fast medical image retrieval. In: Proc. of the IEEE International Symposium on Biomedical Imaging, Arlington, USA, pp.796-799.
4. Yu X., Sun H., and Chen J. (2005). Points matching via iterative convex hull vertices paring. in: Proc. of the fourth International Conference on Machine Learning and Cybernetics, Guangzhou, China, pp. 5350-5354.
5. Gope C., and Kehtarnavaz N. (2007). Affine invariant comparison of point-sets using convex hulls and hausdorff distances. Pattern Recognition, vol.40, no.1, pp.309-320.
6. Yu M. P., and Lo K. C. (2001). Object recognition by combining viewpoint invariant Fourier descriptor and convex hull. in: Proc. of the 2001 International Symposium on Intelligent Multimedia, Video and Speech Processing, Hong Kong, China, pp.401-404.
7. Chand D. R., and Kapur S. S. (1970). An algorithm for convex polytopes. JACM, vol.17, no.1, pp.78- 86.
8. Jarvis R. A. (1973). On the identification of the convex hull of a finite set of points in the plane. Information Processing Letters, vol.2, no.1, pp.18- 21.
9. Graham R. L. (1972). An efficient algorithm for determine the convex hull of a finite linear set. Information Processing Letters, vol.1, no.1, pp.132-133.
10. Preparata F. P. and Hong S. J. (1977). Convex hulls of finite sets of points in two and three dimensions. CACM, vol.20, no.2, pp.87-93.
11. Chan T. (1996). Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete Comput. Geom, vol.16, no.3, pp.361-368.
12. Chen W., Wada K., and Kawaguchi K. (2002). Robust algorithms for constructing strongly convex hulls in parallel. Theoretical Computer Science, vol.289, no.1, pp. 277-295.
13. Brönnimann H. et al. (2004). Space-efficient planar convex hull algorithms. Theoretical Computer Science, vol.321, no.1, pp.25-40.
14. Overmars M. H., and Leeuwen J. V. (1981). Maintenance of configurations in the plane. J. Comput. System Sci., vol.23, no.2, pp.166-204.
15. Chan T. M. (2001). Dynamic planar convex hull operations in near-logarithmic amortized time. Journal of the ACM, vol.48, no.1, pp.1-12.
16. Brodal, G. S., and Jacob R. (2002). Dynamic planar convex hull. in: Proc. of the 43rd Annual IEEE Symposium on Foundations of Computer Science, Vancouver, Canada, pp.617-626.
17. Ye Q. (1995). A fast algorithm for convex hull extraction in 2D image. Pattern Recognition Letters, vol.16, no.5, pp.531-537.