An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves

Author: An Phan Thanh   Trang Le Hong  

Publisher: Taylor & Francis Ltd

ISSN: 0233-1934

Source: Optimization, Vol.62, Iss.7, 2013-07, pp. : 975-988

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

This article describes an efficient convex hull algorithm for finite point sets in 3D based on the idea of the Method of Orienting Curves (introduced by Phu in Optimization, 18 (1987) pp. 65-81, for solving optimal control problems with state constraints). The actual run times of our algorithm and known gift-wrapping algorithm on the set of random points (in uniform distribution) show that our algorithm runs significantly faster than the gift-wrapping one.