Parallel Spatial Partitioning is a computational framework in parallel geometric algorithms that divides a spatial domain into non-overlapping regions using concurrent processes to optimize the distribution of geometric data and accelerate spatial queries.
61
Publications
2K
Citations
214
Authors
84
Institutions
Publications per year
2017–2026
17
Publications
61
1–5 of 61
Authors
214
- EM
2
h-index
- MJ
2
h-index
- ÜV
2
h-index
- QG
2
h-index
- MT
2
h-index
1–5 of 214
Institutions
84
Nanyang Technological University
Singapore, Singapore
3 h-index
12 publications
284 citations
China University of Geosciences
Wuhan, China
3 h-index
13 publications
308 citations
Chinese Academy of Sciences
Beijing, China
3 h-index
10 publications
233 citations
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
4 publications
134 citations
Purdue University West Lafayette
West Lafayette, United States
3 h-index
8 publications
315 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
2 h-index
6 publications
275 citations
Sandia National Laboratories
Albuquerque, United States
2 h-index
5 publications
95 citations
Institute of Geographic Sciences and Natural Resources Research
Beijing, China
2 h-index
8 publications
188 citations
1–8 of 84
Venues
- Computers Environment and Urban Systems
3 publications · 151 citations
3
h-index
- International Journal of Geographical Information Systems
3 publications · 130 citations
3
h-index
- IEEE Transactions on Parallel and Distributed Systems
TPDS · 2 publications · 78 citations
2
h-index
- The Journal of Supercomputing
2 publications · 97 citations
2
h-index
- Computers & Geosciences
CAGEO · 2 publications · 21 citations
2
h-index
1–5