Parallel Convex Hull
Parallel Convex Hull is a parallel algorithmic framework in computational geometry designed to efficiently compute the convex hull of a point set by exploiting concurrent processing to reduce computational time complexity compared to sequential approaches.
33
Publications
1.2K
Citations
63
Authors
46
Institutions
Publications per year
2017–2026
2
33
Parallel computational geometry
Alok Aggarwal, Bernard Chazelle, Leonidas Guibas et al. · Algorithmica · 1988 · 216 citations
Efficient parallel convex hull algorithms
Russ Miller, Quentin F. Stout · IEEE Transactions on Computers · 1988 · 115 citations
Parallel algorithms for higher-dimensional convex hulls
Nancy M. Amato, M.T. Goodrich, Edgar A. Ramos · 2002 · 86 citations
Parallel computational geometry
Alok Aggarwal, Bernard Chazelle, Leo J. Guibas et al. · 1985 · 81 citations
1–5 of 33
63
3
h-index
University of Illinois Urbana-Champaign, United States
2 publications · 43 citations
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 63
46
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
3 h-index
3 publications
310 citations

University of Freiburg
Freiburg im Breisgau, Germany
3 h-index
3 publications
44 citations
New York University
New York, United States
2 h-index
3 publications
513 citations

University of East Anglia
Norwich, United Kingdom
2 h-index
2 publications
30 citations
Queen's University
Kingston, Canada
2 h-index
2 publications
51 citations
Courant Institute of Mathematical Sciences
New York, United States
2 h-index
3 publications
513 citations
Brown University
Providence, United States
2 h-index
2 publications
103 citations
IBM (United States)
Armonk, United States
2 h-index
5 publications
337 citations
1–8 of 46
TPDS · 2 publications · 69 citations
2
h-index
2 publications · 38 citations
2
h-index
IJCGA · 2 publications · 35 citations
2
h-index
1 publications · 30 citations
1
h-index
1 publications · 11 citations
1
h-index
1–5