Parallel Geometric Algorithms
Parallel Geometric Algorithms is a subfield of parallel algorithms that focuses on the design and analysis of concurrent methods for solving computational problems involving geometric data structures and spatial relationships.
421
Publications
17.3K
Citations
832
Authors
394
Institutions
Publications per year
2017–2026
50
Parents
Children
Parallel Approximation Algorithms For GeometryParallel Closest Pair ComputationParallel Convex HullParallel Delaunay TriangulationParallel Divide And Conquer GeometryParallel Dynamic Geometric AlgorithmsParallel External Memory Geometric AlgorithmsParallel Geometric Graph AlgorithmsParallel Geometric OptimizationParallel Geometric Searching
421
DELTA. A fast robot with parallel geometry.
R. Clavel · 1988 · 666 citations
An O(logn) parallel connectivity algorithm
Yossi Shiloach, Uzi Vishkin · Journal of Algorithms · 1982 · 598 citations
1–5 of 421
832
18
h-index
11
h-index
9
h-index
8
h-index
7
h-index
1–5 of 832
394

Johns Hopkins University
Baltimore, United States
15 h-index
25 publications
839 citations
Purdue University West Lafayette
West Lafayette, United States
14 h-index
25 publications
1.6K citations
Carnegie Mellon University
Pittsburgh, United States
13 h-index
28 publications
1.4K citations
Courant Institute of Mathematical Sciences
New York, United States
11 h-index
13 publications
794 citations
New York University
New York, United States
11 h-index
13 publications
954 citations
University of Maryland, College Park
College Park, United States
10 h-index
13 publications
432 citations

Carleton University
Ottawa, Canada
9 h-index
17 publications
479 citations

Centre National de la Recherche Scientifique
Paris, France
9 h-index
16 publications
863 citations
1–8 of 394
20 publications · 982 citations
15
h-index
11 publications · 333 citations
11
h-index
10 publications · 411 citations
10
h-index
9 publications · 377 citations
9
h-index
8 publications · 152 citations
9
h-index
1–5