10.9k citations
- University of OklahomaUS1.3k papers
- University of ChicagoUS1.3k papers
- Southern Methodist UniversityUS1.3k papers
- University of Illinois Urbana-ChampaignUS1.3k papers
- McGill UniversityCA1.3k papers
- The Ohio State UniversityUS1.3k papers
- University of PittsburghUS1.3k papers
- University of British ColumbiaCA1.2k papers
- Rutherford Appleton LaboratoryGB1.2k papers
- European Organization for Nuclear ResearchCH1.2k papers
- University of AlbertaCA1.2k papers
- University of OxfordGB1.2k papers
4 papers · 2 filters
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…
Approximation Algorithms for Shortest Descending Paths in Terrains
Mustaq Ahmed, Sandip Das, Sachin Lodha +3
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to f…
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 …