2 citations · 3 across the 6 of their papers we have counts for
8 papers · 1 filter
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…
Visualizing WSPDs and their applications
Anirban Ghosh, F. N. U. Shariful, David Wisnosky
Introduced by Callahan and Kosaraju back in 1995, the concept of well-separated pair decomposition (WSPD) has occupied a special significance in computational geometry when it come…
Bounded-degree plane geometric spanners in practice
Frederick Anderson, Anirban Ghosh, Matthew Graham +2
The construction of bounded-degree plane geometric spanners has been a focus of interest since 2002 when Bose, Gudmundsson, and Smid proposed the first algorithm to construct such…
Experiments with Unit Disk Cover Algorithms for Covering Massive Pointsets
Rachel Friederich, Matthew Graham, Anirban Ghosh +2
Given a set of points in the plane, the Unit Disk Cover (UDC) problem asks to compute the minimum number of unit disks required to cover the points, along with a placement of t…
Sparse Hop Spanners for Unit Disk Graphs
Adrian Dumitrescu, Anirban Ghosh, Csaba D. Tóth
A unit disk graph on a given set of points in the plane is a geometric graph where an edge exists between two points if and only if . A spanning su…
Online Unit Covering in Euclidean Space
Adrian Dumitrescu, Anirban Ghosh, Csaba D. Tóth
We revisit the online Unit Covering problem in higher dimensions: Given a set of points in , that arrive one by one, cover the points by balls of unit radius, so…
Lower bounds on the dilation of plane spanners
Adrian Dumitrescu, Anirban Ghosh
(I) We exhibit a set of 23 points in the plane that has dilation at least , improving the previously best lower bound of for the worst-case dilation of plane spann…
Greedy is good: An experimental study on minimum clique cover and maximum independent set problems for randomly generated rectangles
Ritankar Mandal, Anirban Ghosh, Sasanka Roy +1
Given a set of randomly positioned axis parallel rectangles in 2D, the problem of computing the minimum clique cover (MCC) and maximum independe…