{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:21:40Z","timestamp":1742390500748},"reference-count":5,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[2002,8]]},"abstract":"<jats:p> We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no memory and uses no randomization, (2) no equivalent result is possible for convex subdivisions, (3) there is no competitive online routing algorithm under the Euclidean distance metric in arbitrary triangulations, and (4) there is no competitive online routing algorithm under the link distance metric even when the input graph is restricted to be a Delaunay, greedy, or minimum-weight triangulation. <\/jats:p>","DOI":"10.1142\/s021819590200089x","type":"journal-article","created":{"date-parts":[[2002,8,29]],"date-time":"2002-08-29T23:21:36Z","timestamp":1030663296000},"page":"283-295","source":"Crossref","is-referenced-by-count":30,"title":["ONLINE ROUTING IN CONVEX SUBDIVISIONS"],"prefix":"10.1142","volume":"12","author":[{"given":"PROSENJIT","family":"BOSE","sequence":"first","affiliation":[{"name":"School of Computer Science, Carleton University,  Ottawa, K1S 5B6, Canada"}]},{"given":"ANDREJ","family":"BRODNIK","sequence":"additional","affiliation":[{"name":"IMFM, University of Ljubljana,  Ljubljana, Slovenia"},{"name":"Department of Computer Science,  Lule\u00e5 Technical University, SE-971 87  Lule\u00e5, Sweden"}]},{"given":"SVANTE","family":"CARLSSON","sequence":"additional","affiliation":[{"name":"University of Karlskona\/Ronneby, 371 41 KARLSKRONA, Sweden"}]},{"given":"ERIK D.","family":"DEMAINE","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology,  Laboratory for Computer Science, Cambridge, MA, 02139, USA"}]},{"given":"RUDOLF","family":"FLEISCHER","sequence":"additional","affiliation":[{"name":"Department of Computer Science,  The Hong Kong University of Science and Technology, Kowloon, Hong Kong, China"}]},{"given":"ALEJANDRO","family":"L\u00d3PEZ-ORTIZ","sequence":"additional","affiliation":[{"name":"Department of Computer Science,  University of Waterloo, N2L 3G1, Canada"}]},{"given":"PAT","family":"MORIN","sequence":"additional","affiliation":[{"name":"School of Computer Science, Carleton University,  Ottawa, K1S 5B6, Canada"}]},{"given":"J.","family":"IAN MUNRO","sequence":"additional","affiliation":[{"name":"Department of Computer Science,  University of Waterloo, N2L 3G1, Canada"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90155-4"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001496000281"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90263-2"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02712872"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(72)90045-2"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S021819590200089X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:27:53Z","timestamp":1565123273000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S021819590200089X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":5,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2002,8]]}},"alternative-id":["10.1142\/S021819590200089X"],"URL":"https:\/\/doi.org\/10.1142\/s021819590200089x","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}