Advances in Intelligent Systems and Computing, Springer, ISBN 978-3-319-17995-7, Proceedings of 3rd International Conference on Computer Science, Applied Mathematics and Applications - ICCSAMA 2015, May 11-13, Metz, France, 358 (2015), 15-26 http://dx.doi.org/10.1007/978-3-319-17996-4_2

Determining the convex hull, its lower convex hull, and Voronoi diagram of a point set is a basic operation for many applications of pattern recognition, image processing, and data mining. To date, the lower convex hull of a finite point set is determined from the entire convex hull of the set. There arises a question "How can we determine the lower convex hull of a finite point set without relying on the entire convex hull?" In this paper, we show that the lower convex hull is wrapped by lower facets starting from an extreme edge of the lower convex hull. Then a direct method for determining the lower convex hull of a finite point set in 3D without the entire convex hull is presented. The actual running times on the set of random points (in the uniform distribution) show that our corresponding algorithm runs significantly faster than the incremental convex hull algorithm and some versions of the gift-wrapping algorithm.

CEMAT - Center for Computational and Stochastic Mathematics