E. Welzl and R. Seidel. referred to in [17], p. 25. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Enumerating Extreme Points in Higher Dimensions - Ottmann, Schuierer.. (1995) (10 citations) (Correct)
....the extreme points of P can be enumerated in O(n 2 ) time. Seidel and Welzl present a randomized algorithm which improves the time complexity to O(n 3=2 log n) expected running time in dimension 4 and to O(n 2 Gammac d ) expected time in any fixed dimension d 5, where 1=c d = O(bd=2c 2 ) [20]. They use a randomized divide and conquer approach to partition the problem into suitable smaller subproblems, which are then solved by linear programming. Their result is further improved by Matousek and Schwarzkopf [17] They present a randomized algorithm that determines the extreme points of ....
E. Welzl and R. Seidel. referred to in [17], p. 25.
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