7 citations · 17 across the 11 of their papers we have counts for
4 papers · 1 filter
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…
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…
There are Plane Spanners of Maximum Degree 4
Nicolas Bonichon, Iyad Kanj, Ljubomir Perković +1
Let E be the complete Euclidean graph on a set of points embedded in the plane. Given a constant t >= 1, a spanning subgraph G of E is said to be a t-spanner, or simply a spanner,…
The Stretch Factor of - and -Delaunay Triangulations
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse +1
In this paper we determine the stretch factor of the -Delaunay and -Delaunay triangulations, and we show that this stretch is . Betw…