Randomized Convex Hull Algorithms
Randomized Convex Hull Algorithms is a class of computational geometry algorithms that belong to the broader category of convex hull algorithms, distinguished by the incorporation of randomization in their procedural steps to achieve efficient expected-time complexity in constructing the convex hull of a finite point set.
32
Publications
8.7K
Citations
56
Authors
32
Institutions
Publications per year
2017–2026
2
32
The convex hull of a random set of points
B. Efron · Biometrika · 1965 · 290 citations
How good are convex hull algorithms?
David Avis, Raimund Seidel · Computational Geometry · 1997 · 259 citations
Linear programming and convex hulls made easy
Raimund Seidel · 1990 · 164 citations · Full text
1–5 of 32
56
4
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 56
32

University of Waterloo
Waterloo, Canada
5 h-index
6 publications
174 citations

McGill University
Montreal, Canada
4 h-index
5 publications
397 citations
Princeton University
Princeton, United States
3 h-index
3 publications
5.4K citations
Duke University
Durham, United States
2 h-index
3 publications
149 citations
University of California, Berkeley
Berkeley, United States
2 h-index
2 publications
423 citations

Johns Hopkins University
Baltimore, United States
2 h-index
2 publications
106 citations
Stanford University
Stanford, United States
2 h-index
2 publications
343 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
2 h-index
2 publications
45 citations
1–8 of 32
3 publications · 328 citations
3
h-index
2 publications · 115 citations
2
h-index
2 publications · 322 citations
2
h-index
JACM · 2 publications · 97 citations
2
h-index
1 publications · 11 citations
1
h-index
1–5