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
Parents
12
QuickhullDisk: A faster convex hull algorithm for disks
Linh Kieu Nguyen, Chanyoung Song, Joonghyun Ryu et al. · Applied Mathematics and Computation · 2019 · 19 citations · Full text
1–5 of 12
32
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 32
21
University of Illinois Urbana-Champaign
Urbana, United States
1 h-index
1 publications
11 citations

Hanyang University
Seoul, South Korea
1 h-index
3 publications
57 citations

National Taipei University
Taipei, Taiwan
1 h-index
2 publications
32 citations
UniLaSalle Amiens (ESIEE-Amiens)
Amiens, France
1 h-index
3 publications
33 citations
University of Balamand
Tripoli, Lebanon
1 h-index
2 publications
22 citations
Guangxi University
Nanning, China
1 h-index
5 publications
75 citations
Vietnam Posts and Telecommunications Group (Vietnam)
Ho Chi Minh City, Vietnam
1 h-index
1 publications
19 citations
University of California, Merced
Merced, United States
1 h-index
2 publications
22 citations
1–8 of 21
1 publications · 12 citations
1
h-index
1 publications · 14 citations
1
h-index
1 publications · 19 citations
1
h-index
1 publications · 16 citations
1
h-index
Repository · 1 publications · 18 citations
1
h-index
1–5