3 citations · 10 across the 6 of their papers we have counts for
5 papers · 1 filter
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…
On the Stretch Factor of Convex Delaunay Graphs
Prosenjit Bose, Paz Carmi, Sebastien Collette +1
Let C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph DG_C(S) of S is define…
Spanners of Complete -Partite Geometric Graphs
Prosenjit Bose, Paz Carmi, Mathieu Couture +3
We address the following problem: Given a complete -partite geometric graph whose vertex set is a set of points in , compute a spanner of that has a ``…
Geometric Spanners With Small Chromatic Number
Prosenjit Bose, Paz Carmi, Mathieu Couture +3
Given an integer , we consider the problem of computing the smallest real number such that for each set of points in the plane, there exists a -spanner f…
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…