Bykat A.: Convex Hull of a Finite Set of Points in Two Dimensions, Info. Proc. Lett., No. 7, 1978. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Randomized Quick Hull - Wenger (1995) (13 citations) (Correct)
....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, ....
Bykat, A. Convex hull of a finite set of points in two dimensions. Inform. Process. Lett. 7 (1978), 296--298.
The Quickhull Algorithm for Convex Hulls - Barber, Dobkin, Huhdanpaa (1996) (89 citations) (Correct)
....point is in a facet s 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 [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 ....
Bykat, A. 1978. Convex hull of a finite set of points in two dimensions. Information Processing Letters 7, 296--298.
FUN with Implementing Algorithms - Fleischer (Correct)
....difficulties of their algorithms. The result were nice theoretical papers describing clever algorithms which from time to time were found to be wrong by other people (often while trying to implement the stuff) doing a more thorough analysis, for example trying to fill in the obvious details ([1, 4, 7, 8, 11, 12, 18, 29] is a short list of such corrections; for sake of completeness, I would like to note that not only theoretical descriptions of algorithms are error prone, but proofs of pure mathematical theorems can have hidden holes as well, see for example [5, 21, 24] Note that I included one of my own ....
A. Bykat. Convex hull of a finite set of points in two dimensions. Information Processing Letters, 7(6):296--298, 1978.
The Quickhull Algorithm for Convex Hulls - Barber, Dobkin, Huhdanpaa (1995) (89 citations) (Correct)
....point is in a facet s 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 ....
A. Bykat. Convex hull of a finite set of points in two dimensions. Information Processing Letters, 7:296--298, 1978.
Determining the Convex Hull in Large Multidimensional Databases - Böhm, Kriegel (2001) (Correct)
No context found.
Bykat A.: Convex Hull of a Finite Set of Points in Two Dimensions, Info. Proc. Lett., No. 7, 1978.
A New Ultimate Convex Hull Algorithm in R² - Rösler, Steiger, Kravitz (2000) (Correct)
No context found.
A. Bykat. Convex hull of a finite set of points in two dimensions. Information Processing Letters 7, (1978), 296-298.
The Graham Scan Triangulates Simple Polygons - Kong, Everett, Toussaint (1991) (2 citations) (Correct)
No context found.
Bykat, A., "Convex hull of a finite set of points in two dimensions," Info. Proc. Lett. 7 (1978), 296-298.
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