K. H. Borgwardt, N. Gaffke, M. Junger, and G. Reinelt. Computing the convex hull in the euclidean plane in linear expected time. In Applied Geometry and Discrete Mathematics THE VICTOR KLEE FESTSCHRIFT, pages 91--107. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 4, 1991.  Home/Search   Document Not in Database   Summary   Related Articles

.... best known deterministic complexity of O(n 2 ) for enumerating extreme points in d dimensions where d 4 [12] In many real world applications, like for example a uniform distribution of the points in the d dimensional unit cube, the number of expected extreme points is considerably less than n [4], in the example of the unit cube O(log d Gamma1 n) 21] A closely related problem to the enumeration of extreme points is the computation of the convex layers of a set P . Starting with the convex hull as the first layer, the ith layer is defined as the convex hull of the set of points ....

K. H. Borgwardt, N. Gaffke, M. Junger, and G. Reinelt. Computing the convex hull in the euclidean plane in linear expected time. In Applied Geometry and Discrete Mathematics THE VICTOR KLEE FESTSCHRIFT, pages 91--107. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 4, 1991.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC