Parallel Geometric Searching
Parallel Geometric Searching is a computational framework within parallel geometric algorithms that specializes in the simultaneous querying of spatial data structures to efficiently determine the presence, location, or relationship of geometric objects across distributed or concurrent processing units.
30
Publications
1.7K
Citations
79
Authors
38
Institutions
Publications per year
2017–2026
4
30
Parallel computational geometry
Alok Aggarwal, Bernard Chazelle, Leonidas Guibas et al. · Algorithmica · 1988 · 216 citations
Parallel computational geometry
Alok Aggarwal, Bernard Chazelle, Leo J. Guibas et al. · 1985 · 81 citations
1–5 of 30
79
2
h-index
2
h-index
Courant Institute of Mathematical Sciences, United States
2 publications · 297 citations
2
h-index
2
h-index
1
h-index
1–5 of 79
38
New York University
New York, United States
3 h-index
5 publications
539 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
3 h-index
3 publications
318 citations
Courant Institute of Mathematical Sciences
New York, United States
3 h-index
5 publications
539 citations
Purdue University West Lafayette
West Lafayette, United States
2 h-index
4 publications
71 citations

University of British Columbia
Vancouver, Canada
2 h-index
3 publications
123 citations
Institute of Information Science, Academia Sinica
Taipei, Taiwan
1 h-index
1 publications
39 citations

Jimei University
Xiamen, China
1 h-index
1 publications
36 citations
University of Sheffield
Sheffield, United Kingdom
1 h-index
4 publications
100 citations
1–8 of 38
3 publications · 245 citations
3
h-index
Conference · 2 publications · 72 citations
2
h-index
TOMS · 1 publications · 26 citations
1
h-index
1 publications · 18 citations
1
h-index
CAGEO · 1 publications · 36 citations
1
h-index
1–5