{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:07:35Z","timestamp":1742933255160,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033667"},{"type":"electronic","value":"9783642033674"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03367-4_14","type":"book-chapter","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T03:56:42Z","timestamp":1248062202000},"page":"156-167","source":"Crossref","is-referenced-by-count":8,"title":["Shortest Path Problems on a Polyhedral Surface"],"prefix":"10.1007","author":[{"suffix":"IV","given":"Atlas F.","family":"Cook","sequence":"first","affiliation":[]},{"given":"Carola","family":"Wenk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"14_CR1","doi-asserted-by":"publisher","first-page":"1689","DOI":"10.1137\/S0097539793253371","volume":"26","author":"P.K. Agarwal","year":"1997","unstructured":"Agarwal, P.K., Aronov, B., O\u2019Rourke, J., Schevon, C.A.: Star unfolding of a polytope with applications. SIAM Journal on Computing\u00a026(6), 1689\u20131713 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR2","series-title":"Handbook of Computational Geometry","first-page":"1","volume-title":"Davenport\u2013Schinzel Sequences and Their Geometric Applications","author":"P.K. Agarwal","year":"2000","unstructured":"Agarwal, P.K., Sharir, M.: Davenport\u2013Schinzel Sequences and Their Geometric Applications. Handbook of Computational Geometry, pp. 1\u201347. Elsevier, Amsterdam (2000)"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1142\/S0218195998000187","volume":"8","author":"G. Albers","year":"1998","unstructured":"Albers, G., Mitchell, J.S.B., Guibas, L.J., Roos, T.: Voronoi diagrams of moving points. Journal of Computational Geometry & Applications\u00a08, 365\u2013380 (1998)","journal-title":"Journal of Computational Geometry & Applications"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/11821069_9","volume-title":"Mathematical Foundations of Computer Science 2006","author":"L. Aleksandrov","year":"2006","unstructured":"Aleksandrov, L., Djidjev, H., Huo, G., Maheshwari, A., Nussbaum, D., Sack, J.-R.: Approximate shortest path queries on weighted polyhedral surfaces. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 98\u2013109. Springer, Heidelberg (2006)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1142\/S0218195995000064","volume":"5","author":"H. Alt","year":"1995","unstructured":"Alt, H., Godau, M.: Computing the Fr\u00e9chet distance between two polygonal curves. Journal of Computational Geometry & Applications\u00a05, 75\u201391 (1995)","journal-title":"Journal of Computational Geometry & Applications"},{"issue":"1","key":"14_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF02293047","volume":"8","author":"B. Aronov","year":"1992","unstructured":"Aronov, B., O\u2019Rourke, J.: Nonoverlap of the star unfolding. Discrete and Computational Geometry\u00a08(1), 219\u2013250 (1992)","journal-title":"Discrete and Computational Geometry"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-540-30538-5_15","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"V. Chandru","year":"2004","unstructured":"Chandru, V., Hariharan, R., Krishnakumar, N.M.: Short-cuts on star, source and planar unfoldings. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol.\u00a03328, pp. 174\u2013185. Springer, Heidelberg (2004)"},{"issue":"2","key":"14_CR8","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1142\/S0218195996000095","volume":"6","author":"J. Chen","year":"1996","unstructured":"Chen, J., Han, Y.: Shortest paths on a polyhedron. Journal of Computational Geometry & Applications\u00a06(2), 127\u2013144 (1996)","journal-title":"Journal of Computational Geometry & Applications"},{"key":"14_CR9","unstructured":"Chiang, Y., Mitchell, J.S.B.: Two-point Euclidean shortest path queries in the plane. In: 10th Symposium on Discrete Algorithms (SODA), pp. 215\u2013224 (1999)"},{"key":"14_CR10","unstructured":"Cook IV, A.F., Wenk, C.: Geodesic Fr\u00e9chet distance inside a simple polygon. In: 25th Symposium on Theoretical Aspects of Computer Science, STACS (2008)"},{"key":"14_CR11","unstructured":"Cook IV, A.F., Wenk, C.: Geodesic Fr\u00e9chet distance with polygonal obstacles. Technical Report CS-TR-2008-010, University of Texas at San Antonio (2008)"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Cook IV, A.F., Wenk, C.: Shortest path problems on a polyhedral surface. Technical Report CS-TR-2009-001, University of Texas at San Antonio (2009)","DOI":"10.1007\/978-3-642-03367-4_14"},{"key":"14_CR13","unstructured":"Cook IV, A.F., Wenk, C.: Shortest path problems on a polyhedral surface. In: 25th European Workshop on Computational Geometry (EuroCG) (2009)"},{"key":"14_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511735172","volume-title":"Geometric Folding Algorithms: Linkages, Origami, Polyhedra","author":"E.D. Demaine","year":"2007","unstructured":"Demaine, E.D., O\u2019Rourke, J.: Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge University Press, New York (2007)"},{"issue":"5","key":"14_CR15","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0925-7721(95)00053-4","volume":"6","author":"O. Devillers","year":"1996","unstructured":"Devillers, O., Golin, M., Kedem, K., Schirra, S.: Queries on Voronoi diagrams of moving points. Computational Geometry: Theory & Applications\u00a06(5), 315\u2013327 (1996)","journal-title":"Computational Geometry: Theory & Applications"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L.J. Guibas","year":"1987","unstructured":"Guibas, L.J., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica\u00a02, 209\u2013233 (1987)","journal-title":"Algorithmica"},{"issue":"6","key":"14_CR17","doi-asserted-by":"publisher","first-page":"2215","DOI":"10.1137\/S0097539795289604","volume":"28","author":"J. Hershberger","year":"1999","unstructured":"Hershberger, J., Suri, S.: An optimal algorithm for Euclidean shortest paths in the plane. SIAM Journal on Computing\u00a028(6), 2215\u20132256 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-51542-9_23","volume-title":"Algorithms and Data Structures","author":"Y.-H. Hwang","year":"1989","unstructured":"Hwang, Y.-H., Chang, R.-C., Tu, H.-Y.: Finding all shortest path edge sequences on a convex polyhedron. In: Dehne, F., Santoro, N., Sack, J.-R. (eds.) WADS 1989. LNCS, vol.\u00a0382. Springer, Heidelberg (1989)"},{"key":"14_CR19","unstructured":"Maheshwari, A., Yi, J.: On computing Fr\u00e9chet distance of two paths on a convex polyhedron. In: 21st European Workshop on Computational Geometry (EuroCG) (2005)"},{"issue":"4","key":"14_CR20","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1137\/0216045","volume":"16","author":"J.S.B. Mitchell","year":"1987","unstructured":"Mitchell, J.S.B., Mount, D.M., Papadimitriou, C.H.: The discrete geodesic problem. SIAM Journal on Computing\u00a016(4), 647\u2013668 (1987)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"14_CR21","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1137\/0219040","volume":"19","author":"D.M. Mount","year":"1990","unstructured":"Mount, D.M.: The number of shortest paths on the surface of a polyhedron. SIAM Journal on Computing\u00a019(4), 593\u2013611 (1990)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"O\u2019Rourke, J., Schevon, C.: Computing the geodesic diameter of a 3-polytope. In: 5th Symposium on Computational Geometry (SoCG), pp. 370\u2013379 (1989)","DOI":"10.1145\/73833.73874"},{"key":"14_CR23","unstructured":"Schevon, C., O\u2019Rourke, J.: The number of maximal edge sequences on a convex polytope. In: 26th Allerton Conference on Communication, Control, and Computing, pp. 49\u201357 (1988)"},{"issue":"1-3","key":"14_CR24","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/s00454-007-9031-0","volume":"39","author":"Y. Schreiber","year":"2008","unstructured":"Schreiber, Y., Sharir, M.: An optimal-time algorithm for shortest paths on a convex polytope in three dimensions. Discrete & Computational Geometry\u00a039(1-3), 500\u2013579 (2008)","journal-title":"Discrete & Computational Geometry"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03367-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T14:02:24Z","timestamp":1580306544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03367-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033667","9783642033674"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03367-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}