Query Preprocessing Tradeoffs
Query Preprocessing Tradeoffs is a theoretical construct in computational geometry that characterizes the inherent compromise between the time or space cost of preprocessing a subdivision and the efficiency of subsequent point location queries within it.
28
Publications
1.2K
Citations
54
Authors
34
Institutions
Publications per year
2017–2026
4
Parents
28
1991 · 323 citations · Full text
Ray Shooting and Parametric Search
Pankaj K. Agarwal · SIAM Journal on Computing · 1993 · 174 citations
Ray shooting and parametric search
Pankaj K. Agarwal · 1992 · 64 citations
1–5 of 28
54
3
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 54
34

Tel Aviv University
Tel Aviv, Israel
5 h-index
9 publications
479 citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
4 h-index
7 publications
170 citations

University of Southern Denmark
Odense, Denmark
2 h-index
2 publications
53 citations
University of Maryland, College Park
College Park, United States
2 h-index
2 publications
40 citations
Duke University
Durham, United States
2 h-index
3 publications
116 citations
Stanford University
Stanford, United States
1 h-index
1 publications
15 citations
Utrecht University
Utrecht, The Netherlands
1 h-index
1 publications
20 citations
Freie Universität Berlin
Berlin, Germany
1 h-index
2 publications
38 citations
1–8 of 34
3 publications · 241 citations
3
h-index
1 publications · 15 citations
1
h-index
JACM · 1 publications · 61 citations
1
h-index
1 publications · 30 citations
1
h-index
CC · 1 publications · 30 citations
1
h-index
1–5