Showing papers on "Convex hull algorithms published in 1970"
TL;DR: The algorithm described in this paper avoids all the unnecessary calculations, and the convex polytope of a set S C E n is generated by systematical ly computing the faces from the edges of the desired convexpolytope.
Abstract: An algorithm, one tha t is economical and fast, for generating the convex polytope of a set S of points lying in an n-dimensional Euclidean space E\" is described. In the existing brute force method for determining the convex hull of a set of points lying in a two-dimensional space, one computes all possible s t ra ight lines joining each pair of points of S and tests whether the lines bound the given set S. This method can easily be generalized for computing the convex hull of a set S C E\", n > 2. However, it turns out tha t this approach is not feasible due to excessive computer run time for a set of points lying in E n when n > 3. The algorithm described in this paper avoids all the unnecessary calculations, and the convex polytope of a set S C E n is generated by systematical ly computing the faces from the edges of the desired convex polytope. A numerical comparison indicates tha t this new approach is far superior to the existing brute force technique.
287 citations