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

Authors

54

  1. HK
    Haim Kaplan

    Tel Aviv University, Israel

    3 publications · 313 citations

    3

    h-index

  2. SA
    Sunil Arya

    University of Maryland, College Park, United States

    3 publications · 54 citations

    3

    h-index

  3. PK
    Pankaj K. Agarwal

    Duke University, United States

    3 publications · 264 citations

    3

    h-index

  4. MS
    Micha Sharir

    Tel Aviv University, Israel

    3 publications · 90 citations

    3

    h-index

  5. AV
    Andrew V. Goldberg

    Stanford University, United States

    2 publications · 310 citations

    2

    h-index

1–5 of 54

Venues

  1. SIAM Journal on Computing

    3 publications · 241 citations

    3

    h-index

  2. Theoretical Computer Science

    1 publications · 15 citations

    1

    h-index

  3. Journal of the ACM

    JACM · 1 publications · 61 citations

    1

    h-index

  4. Knowledge and Information Systems

    1 publications · 30 citations

    1

    h-index

  5. Computational Complexity

    CC · 1 publications · 30 citations

    1

    h-index

1–5