{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T21:23:12Z","timestamp":1730236992405,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,3]]},"DOI":"10.1109\/iccta.2007.113","type":"proceedings-article","created":{"date-parts":[[2007,4,19]],"date-time":"2007-04-19T16:38:58Z","timestamp":1177000738000},"page":"9-19","source":"Crossref","is-referenced-by-count":10,"title":["Rubberband Algorithms for Solving Various 2D or 3D Shortest Path Problems"],"prefix":"10.1109","author":[{"given":"Fajie","family":"Li","sequence":"first","affiliation":[]},{"given":"Reinhard","family":"Klette","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1976.4309569"},{"year":"0","key":"22"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997839"},{"key":"23","first-page":"21","article-title":"A dynamical programming solution for shortest path itineraries in robotics","volume":"9","author":"talbot","year":"2004","journal-title":"Electr J Undergrad Math"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(92)90014-J"},{"year":"0","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044482537-7\/50016-4"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2006.06.021"},{"year":"0","key":"14"},{"year":"0","key":"11"},{"year":"0","key":"12"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00146-0"},{"key":"3","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0020-0255(92)90072-G","article-title":"The zookeeper route problem","volume":"63","author":"chin","year":"1992","journal-title":"Information Sciences"},{"year":"0","key":"20"},{"year":"0","key":"2"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2002.1017622"},{"journal-title":"Digital Geometry","year":"2004","author":"klette","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1080\/07408179708966382"},{"journal-title":"Approximation Algorithms for NP-Hard Problems","year":"1997","key":"6"},{"key":"5","first-page":"473","author":"dror","year":"2003","journal-title":"Touring a sequence of polygons In Proc"},{"year":"0","key":"4"},{"year":"0","key":"9"},{"key":"8","first-page":"168","article-title":"Static and kinetic geometric spanners with applications","author":"karavelas","year":"2001","journal-title":"Proc ACM-SIAM Symp on Discrete Algorithms"}],"event":{"name":"2007 International Conference on Computing Theory and Applications","start":{"date-parts":[[2007,3,5]]},"location":"Kolkata","end":{"date-parts":[[2007,3,7]]}},"container-title":["2007 International Conference on Computing: Theory and Applications (ICCTA'07)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4127325\/4127326\/04127336.pdf?arnumber=4127336","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,12,20]],"date-time":"2018-12-20T19:17:07Z","timestamp":1545333427000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/4127336\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/iccta.2007.113","relation":{},"subject":[],"published":{"date-parts":[[2007,3]]}}}