Competitive Online Routing on Delaunay Triangulations
From MaRDI portal
Publication:3188885
DOI10.1007/978-3-319-08404-6_9zbMath1386.68188OpenAlexW2104859809MaRDI QIDQ3188885
Prosenjit Bose, Jean-Lou De Carufel, Perouz Taslakian, Stephane Durocher
Publication date: 2 September 2014
Published in: Algorithm Theory – SWAT 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-08404-6_9
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Online algorithms; streaming algorithms (68W27)
Related Items
Upper and Lower Bounds for Online Routing on Delaunay Triangulations, Competitive Online Routing on Delaunay Triangulations, Upper and lower bounds for online routing on Delaunay triangulations, Improved routing on the Delaunay triangulation, Computational complexity for the problem of optimal intersection of straight line segments by disks, Unnamed Item
