The Community for Technology Leaders
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science (1991)
San Juan, Puerto Rico
Oct. 1, 1991 to Oct. 4, 1991
ISBN: 0-8186-2445-0
pp: 29-38
B. Chazelle , Dept. of Comput. Sci., Princeton Univ., NJ, USA
ABSTRACT
An optimal algorithm for computing hyperplane cuttings is given. It results in a new kind of cutting, which enjoys all the properties of the previous ones and, in addition, can be refined by composition. An optimal algorithm for computing the convex hull of a finite point set in any fixed dimension is also given.
INDEX TERMS
convex hull, optimal convex hull algorithm, hyperplane cuttings, composition
CITATION

B. Chazelle, "An optimal convex hull algorithm and new results on cuttings," [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science(FOCS), San Juan, Puerto Rico, 1991, pp. 29-38.
doi:10.1109/SFCS.1991.185345
95 ms
(Ver 3.3 (11022016))