4 citations · 5 across the 5 of their papers we have counts for
5 papers · 1 filter
Snipperclips: Cutting Tools into Desired Polygons using Themselves
Zachary Abel, Hugo Akitaya, Man-Kwun Chiu +7
We study Snipperclips, a computer puzzle game whose objective is to create a target shape with two tools. The tools start as constant-complexity shapes, and each tool can snip (i.e…
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…
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--graph (the half--graph is equivalent to the D…
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 and an angle , we define the continuous Yao grap…
Towards Tight Bounds on Theta-Graphs
Prosenjit Bose, Jean-Lou De Carufel, Pat Morin +2
We present improved upper and lower bounds on the spanning ratio of -graphs with at least six cones. Given a set of points in the plane, a -graph partitions the plane around…