3 citations · 11 across the 9 of their papers we have counts for
7 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…
Succinct Geometric Indexes Supporting Point Location Queries
Prosenjit Bose, Eric Y. Chen, Meng He +2
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that, by taking advantage of the n points in the data set per…
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 Additively Weighted Point Sets
Prosenjit Bose, Paz Carmi, Mathieu Couture
We study the problem of computing geometric spanners for (additively) weighted point sets. A weighted point set is a set of pairs where is a point in the plane and …
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…