Range Searching is a fundamental geometric data-structuring problem in computational geometry in which a finite set of geometric objects is preprocessed so that, for each query region (range) from a specified family of subsets of space, the subset or aggregate of objects intersecting that region can be determined efficiently.
799
Publications
49.3K
Citations
1.6K
Authors
524
Institutions
Publications per year
2017–2026
87
Publications
799
Christos Faloutsos, King-Ip Lin · 1995 · 901 citations · Full text
John T. Robinson · 1981 · 888 citations · Full text
ɛ-nets and simplex range queries
David Haussler, Emo Welzl · Discrete & Computational Geometry · 1987 · 731 citations · Full text
1–5 of 799
Authors
1.6K
- BC
18
h-index
- CF
15
h-index
- TM
13
h-index
- MS
13
h-index
- PK
12
h-index
1–5 of 1.6K
Institutions
524
Aarhus University
Aarhus, Denmark
18 h-index
42 publications
2K citations
Carnegie Mellon University
Pittsburgh, United States
18 h-index
32 publications
3.5K citations
AT&T (United States)
Bedminster, United States
16 h-index
33 publications
3.3K citations
University of California, Santa Barbara
Santa Barbara, United States
15 h-index
33 publications
2K citations
National University of Singapore
Singapore, Singapore
15 h-index
39 publications
4.3K citations
University of Illinois Urbana-Champaign
Urbana, United States
15 h-index
23 publications
1.1K citations
Princeton University
Princeton, United States
15 h-index
30 publications
2.4K citations
University of Maryland, College Park
College Park, United States
15 h-index
40 publications
4.1K citations
1–8 of 524
Venues
- IEEE Transactions on Knowledge and Data Engineering
TKDE · 43 publications · 2.2K citations
26
h-index
- SIAM Journal on Computing
25 publications · 2.7K citations
21
h-index
- ACM SIGMOD Record
16 publications · 2K citations
16
h-index
- Proceedings of the VLDB Endowment
PVLDB · 20 publications · 1.2K citations
15
h-index
- Discrete & Computational Geometry
14 publications · 1.6K citations
13
h-index
1–5