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

Authors

56

  1. TM
    Timothy M. Chan

    University of Waterloo, Canada

    4 publications · 129 citations

    4

    h-index

  2. WM
    Wolfgang Mulzer

    Freie Universität Berlin, Germany

    2 publications · 45 citations

    2

    h-index

  3. DA
    David Avis

    McGill University, Canada

    2 publications · 306 citations

    2

    h-index

  4. KB
    Kevin Buchin

    Eindhoven University of Technology, Netherlands

    2 publications · 45 citations

    2

    h-index

  5. RS
    Raimund Seidel

    University of California, Berkeley, United States

    2 publications · 423 citations

    2

    h-index

1–5 of 56

Venues

  1. Computational Geometry

    3 publications · 328 citations

    3

    h-index

  2. SIAM Journal on Computing

    2 publications · 115 citations

    2

    h-index

  3. Biometrika

    2 publications · 322 citations

    2

    h-index

  4. Journal of the ACM

    JACM · 2 publications · 97 citations

    2

    h-index

  5. Computers & Mathematics with Applications

    1 publications · 11 citations

    1

    h-index

1–5