An Algorithm for Convex Polytopes

  title={An Algorithm for Convex Polytopes},
  author={Donald R. Chand and Sham S. Kapur},
  journal={J. ACM},
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… CONTINUE READING
Highly Cited
This paper has 164 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.

164 Citations

Citations per Year
Semantic Scholar estimates that this publication has 164 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…