papers

Publications (24)

cs.CG2019

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 , the Yao graph partitions the space around each point into equiangular cones of angle , and connect…

cs.CG2013

A History of Flips in Combinatorial Triangulations

Prosenjit Bose, Sander Verdonschot

Given two combinatorial triangulations, how many edge flips are necessary and sufficient to convert one into the other? This question has occupied researchers for over 75 years. We…

cs.CG2016

Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition

Nicolas Bonichon, Prosenjit Bose, Paz Carmi +3

A geometric graph is angle-monotone if every pair of vertices has a path between them that---after some rotation---is - and -monotone. Angle-monotone graphs are -spa…

cs.CG2021

Convex Polygons in Cartesian Products

Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans +4

We study several problems concerning convex polygons whose vertices lie in a Cartesian product of two sets of real numbers (for short, \emph{grid}). First, we prove that every…

cs.CG2014

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 gr…

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--graph (the half--graph is equivalent to the…