R. Wenger. Randomized Quickhull Journal of Algorithms 17 (1997) 322-329. 7  Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
A New Ultimate Convex Hull Algorithm in R² - Rösler, Steiger, Kravitz (2000) (Correct)
....log h) which Kirkpatrick and Seidel showed to be optimal. The new algorithm that we describe in Section 2 is a generic Quickhull in which the partition point is chosen more carefully. There have been several previous attempts to do this, for example the recent probabilistic algorithm of Wenger [10]. In our new algorithm, in O(n) steps we either prune at least one quarter the points above AB, or else we obtain a 2 vertex G on the upper chain which gives subproblems AG and GB that are well balanced, the largest having at most 3 U 4 points. These properties allow NEWHULL to obtain CH(S) ....
R. Wenger. Randomized Quickhull Journal of Algorithms 17 (1997) 322-329. 7
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