activity
20122023
most citedExperiments with Unit Disk Cover Algorithms for Covering Massive Pointsets

2 citations · 3 across the 6 of their papers we have counts for

collaborators
Showing 2023Show all

1 paper · 1 filter

cs.CG2023

Engineering an algorithm for constructing low-stretch geometric graphs with near-greedy average-degrees

FNU Shariful, Justin Weathers, Anirban Ghosh +1

We design and engineer Fast-Sparse-Spanner, a simple and practical (fast and memory-efficient) algorithm for constructing sparse low stretch-factor geometric graphs on large points…