Algorithms to determine the edges of a convex hull from its vertices Online publication date: Sat, 30-Aug-2014
by Francisco J. López; Art M. Duval
International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO), Vol. 3, No. 3, 2012
Abstract: Trying to develop a fast algorithm that finds all the edges of a convex hull produced three different ideas. The analysis of these resulted in geometric and theoretical findings. One of the contributions of this paper is to describe the three algorithms. The dissemination of the geometric insights and the theory developed is also a contribution. Since one of the objectives is execution speed, the paper presents the results of a computational analysis. The article reports on the algorithms' theoretical complexity and computational performance. This includes a comparison among themselves and against the best available algorithm for the same problem. Two of the new algorithms are efficient, especially in the case of large scale problems. The paper also explains that these algorithms can be accelerated by means of well-known speed-up techniques. Implementing an output sensitive algorithm by Dulá and López (2006) into one of the new algorithms produced the fastest approach.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook