Title :
An optimal convex hull algorithm and new results on cuttings
Author :
Chazelle, Bernard
Author_Institution :
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
Keywords :
computational geometry; composition; convex hull; hyperplane cuttings; optimal convex hull algorithm; Additives; Bridges; Computer science; Identity-based encryption; Polynomials;
Conference_Titel :
Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on
Conference_Location :
San Juan
Print_ISBN :
0-8186-2445-0
DOI :
10.1109/SFCS.1991.185345
