- Laboratoire Bordelais de Recherche en InformatiqueFR2 papers
- Carleton UniversityCA1 paper
- Centre Inria de l'université de BordeauxFR1 paper
- DePaul UniversityUS1 paper
- Institut national de recherche en sciences et technologies du numériqueFR1 paper
- Institut Polytechnique de BordeauxFR1 paper
- Institut Universitaire de FranceFR1 paper
- National Institute of InformaticsJP1 paper
- Université de BordeauxFR1 paper
2 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.CG2012
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…