André van Renssen

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

cs.CG2015

Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations

Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel +2

Consider a weighted graph G where vertices are points in the plane and edges are line segments. The weight of each edge is the Euclidean distance between its two endpoints. A routi…

cs.CG2014

Optimal local routing on Delaunay triangulations defined by empty equilateral triangles

Prosenjit Bose, Rolf Fagerberg, André van Renssen +1

We present a deterministic local routing algorithm that is guaranteed to find a path between any pair of vertices in a half- $θ_{6}$ -graph (the half- $θ_{6}$ -graph is equivalent to the D…

cs.CG2014★ 1 cited

Continuous Yao Graphs

Luis Barba, Prosenjit Bose, Jean-Lou De Carufel +5

In this paper, we introduce a variation of the well-studied Yao graphs. Given a set of points $S \subset R^{2}$ and an angle $0 < θ \leq 2 π$ , we define the continuous Yao grap…