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

Three new algorithms developed to identify the edges of finitely generated convex hulls are introduced. All the three algorithms are based on linear programming and differ in their approaches. The `repelling-support', `projection' and `conical or truncation' approaches are used, their mathematical and geometric foundations are explained and pseudo-codes of each of the three algorithms are given. The complexity of all the three algorithms is expressed and the effectiveness of these algorithms is compared to an algorithm proposed by \textit{R. J.-B. Wets} and \textit{C. Witzgall} [J. Res. Natl. Bur. Stand., Sect. B 71, 1--7 (1967; Zbl 0157.49502)] which solves the same problem and can be considered as the best currently available algorithm.