On constructing approximate convex hull

CCDS Authors

M Ashraful Amin, PhD

Founder DirectorDirector, Artificial Intelligence & Machine Learning WingDirector, Human-Computer Interaction WingDirector, Data Science Wing

References

1. 1.Franco P. Preparata, Michael Ian Shamos. (1985). Computational Geometry. [10.1007/978-1-4612-1098-6]
2. 2.Franco P. Preparata, Michael Ian Shamos. (1985). Computational geometry. an introduction.
3. 3.Ronald Graham. (1972). An efficient algorith for determining the convex hull of a finite planar set. Information Processing Letters, 1(4), 132–133[10.1016/0020-0190(72)90045-2]
4. 4.Joseph O’Rourke, A. John Mallinckrodt. (1995). Computational Geometry in C. Computers in Physics, 9(1), 55[10.1063/1.4823371]
5. 5.James T. Klosowski, Martin Held, Joseph S. B. Mitchell, Henry A. Sowizral, Karel Zikan. (1998). Efficient collision detection using bounding volume hierarchies of k-DOPs. IEEE Transactions on Visualization and Computer Graphics, 4(1), 21–36[10.1109/2945.675649]
6. 6.Joseph O’Rourke. (1998). Computational Geometry in C. Cambridge University Press eBooks[10.1017/cbo9780511804120]
7. 7.Herbert Edelsbrunner, Ernst P. Mücke. (1990). Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics, 9(1), 66–104[10.1145/77635.77639]
8. 8.R.A. Jarvis. (1973). On the identification of the convex hull of a finite set of points in the plane. Information Processing Letters, 2(1), 18–21[10.1016/0020-0190(73)90020-3]
9. 9.David Kirkpatrick, Raimund Seidel. (1986). The Ultimate Planar Convex Hull Algorithm?. SIAM Journal on Computing, 15(1), 287–299[10.1137/0215021]
10. 10.Timothy M. Chan. (1996). Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete & Computational Geometry, 16(4), 361–368[10.1007/bf02712873]
11. 11.Avraham A. Melkman. (1987). On-line construction of the convex hull of a simple polyline. Information Processing Letters, 25(1), 11–12[10.1016/0020-0190(87)90086-x]
12. 12.Joseph O’Rourke. (1998). Computational geometry in C (2nd ed.). Cambridge University Press eBooks
13. 13.Andrew Chi-Chih Yao. (1981). A Lower Bound to Finding Convex Hulls. Journal of the ACM, 28(4), 780–787[10.1145/322276.322289]
14. 14.Selim G. Akl, Godfried T. Toussaint. (1978). A fast convex hull algorithm. Information Processing Letters, 7(5), 219–222[10.1016/0020-0190(78)90003-0]
15. 15.Jon Bentley, Franco P. Preparata, Mark G. Faust. (1982). Approximation algorithms for convex hulls. Communications of the ACM, 25(1), 64–68[10.1145/358315.358392]
16. 16.Xianquan Zhang, Zhenjun Tang, Jinhui Yu, Mingming Guo. (2010). A Fast Convex Hull Algorithm for Binary Image. , 34(3), 369–376[10.31449/inf.v34i3.311]
17. 17.Ioannis Z. Emiris, John Canny, Raimund Seidel. (1997). Efficient Perturbations for Handling Geometric Degeneracies. Algorithmica, 19(1-2), 219–242[10.1007/pl00014417]
18. 18.Ladislav Kavan, Ivana Kolingerová, Jiřı́ Žára. (2006). Fast approximation of convex hull. , 101–104
19. 19.Hawing Hu, Hong Yan. (1997). Polygonal approximation of digital curves based on the principles of perceptual organization. Pattern Recognition, 30(5), 701–718[10.1016/s0031-3203(96)00105-7]
20. 20.Eljas Soisalon-Soininen. (1983). On computing approximate convex hulls. Information Processing Letters, 16(3), 121–126[10.1016/0020-0190(83)90062-5]
21. 21.Richard Bellman, B. G. Kashef, R. Vasudevan. (1974). Mean square spline approximation. Journal of Mathematical Analysis and Applications, 45(1), 47–53[10.1016/0022-247x(74)90119-x]