Rolf Fagerberg

activity

20062023

most citedAn O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times

6 citations · 10 across the 13 of their papers we have counts for

collaborators

Showing cs.CGShow all

5 papers · 1 filter

cs.CG2017

On Plane Constrained Bounded-Degree Spanners

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

Let $P$ be a finite set of points in the plane and $S$ a set of non-crossing line segments with endpoints in $P$ . The visibility graph of $P$ with respect to $S$ , denoted $Vis(P,S)…

cs.CG2014

Competitive Local Routing with Constraints

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

Let $P$ be a set of $n$ vertices in the plane and $S$ a set of non-crossing line segments between vertices in $P$ , called constraints. Two vertices are visible if the straight line…

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…

cs.CG2013★ 1 cited

New and Improved Spanning Ratios for Yao Graphs

Luis Barba, Prosenjit Bose, Mirela Damian +7

For a set of points in the plane and a fixed integer $k > 0$ , the Yao graph $Y_{k}$ partitions the space around each point into $k$ equiangular cones of angle $θ = 2 π / k$ , and connects…