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
Parents
14
1–5 of 14
23
4
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 23
14

Tel Aviv University
Tel Aviv, Israel
4 h-index
8 publications
432 citations

Bar-Ilan University
Ramat Gan, Israel
2 h-index
2 publications
40 citations

University of Waterloo
Waterloo, Canada
2 h-index
2 publications
40 citations
Duke University
Durham, United States
2 h-index
2 publications
176 citations
BP (United Kingdom)
London, United Kingdom
2 h-index
6 publications
171 citations
New York University
New York, United States
2 h-index
2 publications
176 citations
Freie Universität Berlin
Berlin, Germany
2 h-index
4 publications
80 citations
University of Iowa
Iowa City, United States
1 h-index
1 publications
20 citations
1–8 of 14
2 publications · 47 citations
2
h-index
1 publications · 129 citations
1
h-index
1 publications · 61 citations
1
h-index
1 publications · 101 citations
1
h-index
1 publications · 115 citations
1
h-index
1–5