2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.CG2008
Communication-Efficient Construction of the Plane Localized Delaunay Graph
Prosenjit Bose, Paz Carmi, Michiel Smid +1
Let be a finite set of points in the plane. We present a 2-local algorithm that constructs a plane -spanner of the unit-disk graph $\UDG(V)$. This algori…
cs.CG2007★ 2 cited
On a family of strong geometric spanners that admit local routing strategies
Prosenjit Bose, Paz Carmi, Mathieu Couture +2
We introduce a family of directed geometric graphs, denoted $\paz$, that depend on two parameters and . For and , the $\paz$ graph is a str…