Parallel Delaunay Triangulation

Parallel Delaunay Triangulation is a computational method for constructing Delaunay triangulations by simultaneously processing spatial data across multiple processing units, distinguished by its use of parallel algorithms to divide and conquer triangulation tasks for improved efficiency and scalability.

41

Publications

1.3K

Citations

92

Authors

62

Institutions

Publications per year

2017–2026

8

Authors

92

  1. NC
    Nikos Chrisochoides

    William & Mary, United States

    5 publications · 198 citations

    5

    h-index

  2. GL
    Gary L. Miller

    Carnegie Mellon University, United States

    4 publications · 169 citations

    4

    h-index

  3. GE
    Guy E. Blelloch

    Carnegie Mellon University, United States

    4 publications · 169 citations

    4

    h-index

  4. JK
    Josef Kohout

    University of West Bohemia in Pilsen, Czechia

    3 publications · 70 citations

    3

    h-index

  5. AN
    Andrey N. Chernikov

    William & Mary, United States

    3 publications · 50 citations

    3

    h-index

1–5 of 92

Venues

  1. 3

    h-index

  2. The Visual Computer

    2 publications · 34 citations

    2

    h-index

  3. Journal of Parallel and Distributed Computing

    2 publications · 33 citations

    2

    h-index

  4. 2

    h-index

  5. 2

    h-index

1–5