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

Authors

63

  1. NM
    Nancy M. Amato

    Texas A&M University, United States

    3 publications · 129 citations

    3

    h-index

  2. FP
    Franco P. Preparata

    University of Illinois Urbana-Champaign, United States

    2 publications · 43 citations

    2

    h-index

  3. AM
    A. M. Day

    University of East Anglia, United Kingdom

    2 publications · 30 citations

    2

    h-index

  4. MT
    Michael T. Goodrich

    Johns Hopkins University, United States

    2 publications · 56 citations

    2

    h-index

  5. SG
    Selim G. Akl

    Queen's University, Canada

    2 publications · 51 citations

    2

    h-index

1–5 of 63

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 2 publications · 69 citations

    2

    h-index

  2. Probability Theory and Related Fields

    2 publications · 38 citations

    2

    h-index

  3. 2

    h-index

  4. Computing

    1 publications · 30 citations

    1

    h-index

  5. SpringerPlus

    1 publications · 11 citations

    1

    h-index

1–5