research
∙
05/18/2023
Engineering an algorithm for constructing low-stretch geometric graphs with near-greedy average-degrees
We design and engineer Fast-Sparse-Spanner, a simple and practical (fast...
share
research
∙
05/09/2022
Visualizing WSPDs and their applications
Introduced by Callahan and Kosaraju back in 1995, the concept of well-se...
research
∙
05/06/2022
Bounded-degree plane geometric spanners in practice
The construction of bounded-degree plane geometric spanners has been a f...
research
∙
05/03/2022
Experiments with Unit Disk Cover Algorithms for Covering Massive Pointsets
Given a set of n points in the plane, the Unit Disk Cover (UDC) problem ...
research
∙
02/18/2020
Sparse Hop Spanners for Unit Disk Graphs
A unit disk graph G on a given set of points P in the plane is a geometr...
research
∙
10/03/2017