1. Akl, S. G., Toussaint, G. T.: Efficient convex hull algorithms for pattern recognition applications. In: Int. Joint Conf on Pattern Recognition, Kyoto, pp. 483–487 (1978)
2. An, P.T., Hoang, N.D., Linh, N.K., Kim, D.-S., Song, C.: The quickhull algorithm for determining the convex hull of a finite set of discs, presented at the seminar of the Voronoi Diagram Research Center. Hanyang University, Seoul, Korea. Submitted (2018)
3. An, P.T., Trang, L.H.: An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves. Optimization 62, 975–988 (2013)
4. An, P.T., Trang, L.H.: A parallel algorithm based on convexity for the computing of Delaunay tessellation. Numer. Algorithm. 59, 347–357 (2012)
5. Bhaniramka, P., Wenger, R., Crawfis, R.: Isosurface construction in any dimension using convex hulls. IEEE Trans. Vis. Comput. Graph. 10, 130–141 (2004)