Shallow Cuttings

Shallow Cuttings is a geometric decomposition technique in computational geometry that partitions a set of points into subsets through a hierarchical arrangement of lower envelopes, distinguished by its efficiency in approximate range searching through the construction of shallow层次 structures that bound query depth.

14

Publications

657

Citations

23

Authors

14

Institutions

Publications per year

2017–2026

3

Authors

23

  1. MS
    Micha Sharir

    Tel Aviv University, Israel

    4 publications · 224 citations

    4

    h-index

  2. HK
    Haim Kaplan

    Tel Aviv University, Israel

    2 publications · 48 citations

    2

    h-index

  3. PS
    Paul Seiferth

    Tel Aviv University, Israel

    2 publications · 48 citations

    2

    h-index

  4. TM
    Timothy M. Chan

    University of Waterloo, Canada

    2 publications · 40 citations

    2

    h-index

  5. AE
    Alon Efrat

    University of Arizona, United States

    2 publications · 176 citations

    2

    h-index

1–5 of 23

Venues

  1. Discrete & Computational Geometry

    2 publications · 47 citations

    2

    h-index

  2. SIAM Journal on Computing

    1 publications · 129 citations

    1

    h-index

  3. 1

    h-index

  4. CIRP Annals

    1 publications · 101 citations

    1

    h-index

  5. Before Farming

    1 publications · 115 citations

    1

    h-index

1–5