Geometric Partitioning is a computational method in geometric data structures that organizes a geometric space into non-overlapping regions to facilitate efficient query processing and spatial analysis.
176
Publications
9.8K
Citations
408
Authors
203
Institutions
Publications per year
2017–2026
24
Parents
Publications
176
Optimal Search in Planar Subdivisions
David Kirkpatrick · SIAM Journal on Computing · 1983 · 751 citations
Bottom-up computation of sparse and Iceberg CUBE
Kevin Beyer, Raghu Ramakrishnan · ACM SIGMOD Record · 1999 · 464 citations · Full text
Partition based spatial-merge join
Jignesh M. Patel, David J. DeWitt · 1996 · 345 citations
1991 · 323 citations · Full text
1–5 of 176
Authors
408
- PK
5
h-index
- ST
4
h-index
- MT
4
h-index
- PB
3
h-index
- HG
3
h-index
1–5 of 408
Institutions
203
Duke University
Durham, United States
6 h-index
13 publications
1.1K citations
University of Maryland, College Park
College Park, United States
5 h-index
8 publications
655 citations
Carnegie Mellon University
Pittsburgh, United States
5 h-index
5 publications
275 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
4 h-index
11 publications
204 citations
Courant Institute of Mathematical Sciences
New York, United States
4 h-index
4 publications
228 citations
University of Wisconsin–Madison
Madison, United States
4 h-index
8 publications
2.4K citations
Utrecht University
Utrecht, The Netherlands
4 h-index
7 publications
266 citations
University of Illinois Urbana-Champaign
Urbana, United States
4 h-index
8 publications
229 citations
1–8 of 203
Venues
- Computational Geometry
7 publications · 207 citations
7
h-index
- International Journal of Computational Geometry & Applications
IJCGA · 4 publications · 85 citations
4
h-index
- Discrete Applied Mathematics
4 publications · 73 citations
4
h-index
- IEEE Transactions on Knowledge and Data Engineering
TKDE · 3 publications · 138 citations
3
h-index
- Computer-Aided Design
3 publications · 76 citations
3
h-index
1–5