Green P. J., Silverman B. W.: Constructing the Convex Hull of a Set of Points in the Plane, Computer Journal, Vol. 22, 1979.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....year, R. Jarvis gave an algorithm whose running time depends on the output size [14] Jarvis s algorithm runs in O(nh) time where h is the number of points in the convex hull. The next ten years saw many other algorithms for finding convex hulls in the plane most of which run in O(n log n) time [1, 4, 11, 13, 16]. Some very simple algorithms were proposed which have O(n) expected running time for many distributions of points in the plane (such as points with normal density) 10, 3] During this period, Avis [2] and Yao [20] proved lower bounds of Omega Gamma n log n) on the time to find a convex hull, ....

Green, P. J., and Silverman, B. W. Constructing the convex hull of a set of points in the plane. Comput. J. 22 (1979), 262--266.

....if it is above the facet. Like Clarkson and Shor s algorithm, an unprocessed point is in exactly one outside set. Our variation is to process the furthest point of an outside set instead of a random point. In R 2 , this is the well known Quickhull Algorithm [Bykat 1978] Eddy 1977] Floyd 1976] [Green and Silverman 1979]. Other variations of the Clarkson and Shor algorithm do not maintain conflict graphs or outside sets. Instead, they retain old facets of the convex hull with links to the new facets that replaced them. This hierarchy begins with an initial simplex formed from d 1 of the input points. The ....

Green, P. and Silverman, B. 1979. Constructing the convex hull of a set of points in the plane. Computer Journal 22, 262--266.

....Markus [72] uses the convex hull of the scatter of the bootstrap points to construct the confidence regions. She then discards the ## 100# of the outer vertices of the hull, and the resulting hull is considered to be the desired confidence region (this algorithm is discussed in [46] see also [45]) This method resembles the percentile method for estimating bootstrap confidence intervals [26] 5.5. Results of Previous Studies. There have been several studies that have used bootstrap methods to assess the stability of nonlinear multivariate techniques homogeneity analysis, correspondence ....

Green, P.J. and Silverman, B.W. (1979), "Constructing the Convex Hull of a Set of Points in the Plane," Computer Journal, 22, 262-266

....outside set only if it is above the facet. Like Clarkson and Shor s algorithm, an unprocessed point is in exactly one outside set. Our variation is to process the furthest point of an outside set instead of a random point. In R 2 , this is the well known Quickhull Algorithm [10] 20] 22] [26]. Other variations of the Clarkson and Shor algorithm do not maintain conflict graphs or outside sets. Instead, they retain old facets of the convex hull with links to the new facets that replaced them. This hierarchy begins with an initial simplex formed from d 1 of the input points. The ....

P.J. Green and B.W. Silverman. Constructing the convex hull of a set of points in the plane. Computer Journal, 22(262-266), 1979.

No context found.

Green P. J., Silverman B. W.: Constructing the Convex Hull of a Set of Points in the Plane, Computer Journal, Vol. 22, 1979.

No context found.

P.J. Green and B.W. Silverman. Constructing the convex hull of a set of points in the plane, Computer Journal 22 (1979),, 262-266.

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