{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:54Z","timestamp":1725663294811},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540515425"},{"type":"electronic","value":"9783540482376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51542-9_23","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:06:38Z","timestamp":1330185998000},"page":"251-266","source":"Crossref","is-referenced-by-count":3,"title":["Finding All Shortest Path Edge Sequences on a convex polyhedron"],"prefix":"10.1007","author":[{"given":"Yie-Huei","family":"Hwang","sequence":"first","affiliation":[]},{"given":"Ruei-Chuan","family":"Chang","sequence":"additional","affiliation":[]},{"given":"Hung-Yi","family":"Tu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"issue":"2","key":"23_CR1","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1145\/42282.214094","volume":"35","author":"A. Baltson","year":"1988","unstructured":"A. Baltson, M. Sharir, On Shortest Paths between Two Convex Polyhedra, JACM, Vol. 35, No. 2, April 1988, pp. 267\u2013287.","journal-title":"JACM"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. W. Dijkstra","year":"1959","unstructured":"E. W. Dijkstra, A Note on Two Problems in Connection with Graphs, Numerische Mathematik, Vol. 1, 1959, pp. 269\u2013271.","journal-title":"Numerische Mathematik"},{"issue":"2","key":"23_CR3","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L. Guibas","year":"1987","unstructured":"L. Guibas, J. Herchberger, K. Leven, M. Sharir, R. Tarjan, Linear Time Algorithms for Visibility and Shortest Path Problems inside Simple Polygons, Algorithmica, Vol. 2, No. 2, 1987, pp. 209\u2013233.","journal-title":"Algorithmica"},{"key":"23_CR4","unstructured":"J. S. B. Mitchell, Planning Shortest Paths, Ph. D. Thesis, Department of Operations Research, Stanford University, August 1986."},{"key":"23_CR5","series-title":"Technical Report","volume-title":"On Finding Shortest Paths on Convex Polyhedra","author":"D. M. Mount","year":"1984","unstructured":"D. M. Mount, On Finding Shortest Paths on Convex Polyhedra, Technical Report 1495, Computer Science Department, University of Maryland, College Park, 1984."},{"key":"23_CR6","series-title":"Technical Report","volume-title":"The Number of Shortest Paths on the Surface of a Polyhedron","author":"D. M. Mount","year":"1986","unstructured":"D. M. Mount, The Number of Shortest Paths on the Surface of a Polyhedron, Technical Report, Computer Science Department, University of Maryland, College Park, MD, 1986."},{"key":"23_CR7","unstructured":"J. O'Rourke, S. Suri, and H. Booth, Shortest Paths on Polyhedral Surfaces, Manuscript, Johns Hopkins University, 1984."},{"key":"23_CR8","unstructured":"C. Schevon, J. O'Rourke, The Number of Maximal Edges Sequences on a Convex Polytope, Proceedings of Allerton Conference, 1988."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"C. H. Papadimitriou, An Algorithm for Shortest-Path Motion in Three Dimensions, Information Processing Letter, Vol. 20, No. 5, 12 June, 1985.","DOI":"10.1016\/0020-0190(85)90029-8"},{"issue":"3","key":"23_CR10","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1137\/0216038","volume":"16","author":"M. Sharir","year":"1987","unstructured":"M. Sharir, On Shortest Paths Amidst Convex Polyhedra, SIAM J. Comput., Vol. 16, No. 3, June 1987, pp. 561\u2013572.","journal-title":"SIAM J. Comput."},{"issue":"1","key":"23_CR11","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1137\/0215014","volume":"15","author":"M. Sharir","year":"1986","unstructured":"M. Sharir and A. Schorr, On Shortest Paths in Polyhedral Spaces, SIAM J. Comput., Vol. 15, No. 1, Feburary 1986, pp. 193\u2013215.","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51542-9_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:04:34Z","timestamp":1619557474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51542-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515425","9783540482376"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-51542-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}