Quickhull

Quickhull is a divide-and-conquer algorithm for computing the convex hull of a finite set of points in the plane that recursively partitions the point set by identifying extreme points and eliminating interior points relative to the current hull edges.

12

Publications

5.6K

Citations

32

Authors

21

Institutions

Publications per year

2017–2026

3

Authors

32

  1. CB
    C. Bradford Barber

    University of Minnesota, United States

    1 publications · 5.3K citations

    1

    h-index

  2. XL
    Xiaoping Liao

    Guangxi University, China

    1 publications · 15 citations

    1

    h-index

  3. JR
    Joonghyun Ryu

    Hanyang University, South Korea

    1 publications · 19 citations

    1

    h-index

  4. DK
    Deok‐Soo Kim

    Hanyang University, South Korea

    1 publications · 19 citations

    1

    h-index

  5. CF
    Charbel Fares

    UniLaSalle Amiens (ESIEE-Amiens), France

    1 publications · 11 citations

    1

    h-index

1–5 of 32

Venues

  1. Machine Learning with Applications

    1 publications · 12 citations

    1

    h-index

  2. Computational Optimization and Applications

    1 publications · 14 citations

    1

    h-index

  3. Applied Mathematics and Computation

    1 publications · 19 citations

    1

    h-index

  4. Journal of the Chinese Institute of Engineers

    1 publications · 16 citations

    1

    h-index

  5. arXiv (Cornell University)

    Repository · 1 publications · 18 citations

    1

    h-index

1–5