Showing cs.CGShow all
3 papers · 1 filter
cs.CG2026
Optimal-Cost Construction of Shallow Cuttings for 3-D Dominance Ranges in the I/O-Model
Yakov Nekrich, Saladi Rahul
Shallow cuttings are a fundamental tool in computational geometry and spatial databases for solving offline and online range searching problems. For a set of points in 3-D,…
cs.CG2025
A Bouquet of Results on Maximum Range Sum: General Techniques and Hardness Reductions
Rachana Gusain, Saladi Rahul, Aditya Subramanian
We revisit the maximum range sum (MaxRS) problem: given a set of weighted points in and a range (typically axis-aligned -box or -ball), the goal is…
cs.CG2024
Approximating Densest Subgraph in Geometric Intersection Graphs
Sariel Har-Peled, Rahul Saladi
$ \newcommand{\cardin}[1]{\left| {#1} \right|}% \newcommand{\Graph}{\Mh{\mathsf{G}}}% \providecommand{\G}{\Graph}% \renewcommand{\G}{\Graph}% \providecommand{\GA}{\Mh{H}}% \renewco…