Colored Range Searching

Colored Range Searching is a computational geometry problem in which a set of colored points is preprocessed into a data structure to efficiently report or count the distinct colors present within a specified query range.

6

Publications

136

Citations

15

Authors

8

Institutions

Publications per year

2017–2026

0

Authors

15

  1. YN
    Yakov Nekrich

    University of Kansas, United States

    2 publications · 38 citations

    2

    h-index

  2. MS
    Micha Sharir

    Tel Aviv University, Israel

    1 publications · 41 citations

    1

    h-index

  3. SJ
    Simon J. Puglisi

    University of Helsinki, Finland

    1 publications · 33 citations

    1

    h-index

  4. MK
    Marek Karpiński

    University of Bonn, Germany

    1 publications · 16 citations

    1

    h-index

  5. HK
    Haim Kaplan

    Tel Aviv University, Israel

    1 publications · 41 citations

    1

    h-index

1–5 of 15

Venues

  1. ACM Transactions on Database Systems

    TODS · 1 publications · 22 citations

    1

    h-index

  2. ArXiv.org

    Repository · 1 publications · 16 citations

    1

    h-index

  3. Theoretical Computer Science

    1 publications · 33 citations

    1

    h-index

  4. SIAM Journal on Computing

    1 publications · 41 citations

    1

    h-index

  5. Journal of Discrete Algorithms

    1 publications · 11 citations

    1

    h-index

1–5