{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:14:10Z","timestamp":1725455650132},"publisher-location":"Berlin\/Heidelberg","reference-count":5,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540139125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0024013","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T05:44:22Z","timestamp":1132379062000},"page":"243-254","source":"Crossref","is-referenced-by-count":10,"title":["Shortest paths on polyhedral surfaces"],"prefix":"10.1007","author":[{"given":"Joseph","family":"O'Rourke","sequence":"first","affiliation":[]},{"given":"Subhash","family":"Suri","sequence":"additional","affiliation":[]},{"given":"Heather","family":"Booth","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","volume-title":"Graphs, Surfaces, and Homology","author":"P. J. Giblin","year":"1977","unstructured":"P. J. Giblin, Graphs, Surfaces, and Homology, Wiley, New York, 1977."},{"key":"25_CR2","unstructured":"D. T. Lee and F. P. Preparata, \"Euclidean shortest paths in the presence of rectilinear boundaries,\" Proc. 7th Conf. on Graphtheoretical Concepts in Computer Science (1981), 303\u2013316."},{"key":"25_CR3","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/359156.359164","volume":"22","author":"T. Lozano-Perez","year":"1979","unstructured":"T. Lozano-Perez and M. A. Wesley, \"An algorithm for planning collision-free paths among polyhedral obstacles,\" CACM, 22 (1979) 560\u2013570.","journal-title":"CACM"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"D. M. Mount, \"On finding shortest paths on convex polyhedra,\" in preparation (1984).","DOI":"10.21236\/ADA166246"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"M. Sharir and A. Schorr, \"On shortest paths in polyhedral spaces,\" Proc. 16th Symp. on Theory of Computing (1984), 144\u2013153; full version: Technical Report 84\u2013001, Tel Aviv University, Mar. 1984.","DOI":"10.1145\/800057.808676"}],"container-title":["Lecture Notes in Computer Science","STACS 85"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024013.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:51:28Z","timestamp":1607550688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540139125"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/bfb0024013","relation":{},"subject":[]}}