Algorithms to determine the edges of a convex hull from its vertices

Publication Date


Document Type



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.