Parallel Combinatorial Geometry

Parallel Combinatorial Geometry is a computational framework within parallel computational geometry that specifically addresses the decomposition, arrangement, and intersection of discrete geometric objects using concurrent algorithms to enhance computational efficiency.

8

Publications

783

Citations

29

Authors

11

Institutions

Publications per year

2017–2026

2

Authors

29

  1. SP
    Sreepathi Pai

    The University of Texas at Austin, United States

    1 publications · 39 citations

    1

    h-index

  2. KM
    Kurt Mehlhorn

    Max Planck Institute for Informatics, Germany

    1 publications · 146 citations

    1

    h-index

  3. CV
    Chad Voegele

    The University of Texas at Austin, United States

    1 publications · 39 citations

    1

    h-index

  4. KP
    Keshav Pingali

    The University of Texas at Austin, United States

    1 publications · 39 citations

    1

    h-index

  5. NS
    Nodari Sitchinava

    University of California, Irvine, United States

    1 publications · 32 citations

    1

    h-index

1–5 of 29

Venues

  1. Algorithmica

    2 publications · 32 citations

    2

    h-index

  2. Lecture notes in computer science

    LNCS · Book series · 1 publications · 146 citations

    1

    h-index

  3. Nuclear Science and Techniques

    NST · 1 publications · 26 citations

    1

    h-index

  4. Proceedings of the International Conference on Parallel Processing

    Conference · 1 publications · 19 citations

    1

    h-index

  5. Computers & Mathematics with Applications

    1 publications · 489 citations

    1

    h-index

1–5