A Direct Method for Determining the Lower Convex Hull of a Finite Point Set in 3D
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.
KeywordsConvex Hull Extreme Edge Gift-wrapping Algorithm Lower Convex Hull Pattern Recognition Voronoi Diagram
Unable to display preview. Download preview PDF.
- 1.Akl, S.G., Toussaint, G.: Efficient convex hull algorithms for pattern recognition applications. In: 4th Int’l Joint Conf. on Pattern Recognition, Kyoto, Japan, pp. 483–487 (1978)Google Scholar
- 4.Luo, D.: Pattern Recognition and Image Processing. Woodhead Publishing (1998)Google Scholar
- 6.Meethongjan, K., Dzulkifli, M., Rehman, A., Saba, T.: Face recognition based on fusion of Voronoi diagram automatic facial and wavelet moment invariants. International Journal of Video & Image Processing and Network Security 10(4), 1–8 (2010)Google Scholar
- 8.Okabe, A., Boots, B., Sugihara, K.: Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, 2nd edn. John Wiley & Sons Ltd (2000)Google Scholar
- 9.O’Rourke, J.: Computational Geometry in C, 2nd edn. Cambridge University Press (1998)Google Scholar