{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:43:54Z","timestamp":1725489834158},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540742715"},{"type":"electronic","value":"9783540742722"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74272-2_82","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T07:24:12Z","timestamp":1187335452000},"page":"661-668","source":"Crossref","is-referenced-by-count":0,"title":["Euclidean Shortest Paths in Simple Cube Curves at a Glance"],"prefix":"10.1007","author":[{"given":"Fajie","family":"Li","sequence":"first","affiliation":[]},{"given":"Reinhard","family":"Klette","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"82_CR1","unstructured":"Bajaj, C.: The algebraic complexity of shortest paths in polyhedral spaces. In: Proc. Allerton Conf. Commun. Control Comput., pp. 510\u2013517 (1985)"},{"key":"82_CR2","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF02187906","volume":"3","author":"C. Bajaj","year":"1988","unstructured":"Bajaj, C.: The algebraic degree of geometric optimization problems. Discrete Computational Geometry\u00a03, 177\u2013191 (1988)","journal-title":"Discrete Computational Geometry"},{"key":"82_CR3","doi-asserted-by":"publisher","first-page":"713","DOI":"10.2307\/2004849","volume":"24","author":"E.R. Berlekamp","year":"1970","unstructured":"Berlekamp, E.R.: Factoring polynomials over large finite fields. Math. Comp.\u00a024, 713\u2013735 (1970)","journal-title":"Math. Comp."},{"key":"82_CR4","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/TPAMI.2002.1017622","volume":"24","author":"T. B\u00fclow","year":"2002","unstructured":"B\u00fclow, T., Klette, R.: Digital curves in 3D space and a linear-time length estimation algorithm. IEEE Trans. Pattern Analysis Machine Intelligence\u00a024, 962\u2013970 (2002)","journal-title":"IEEE Trans. Pattern Analysis Machine Intelligence"},{"key":"82_CR5","doi-asserted-by":"crossref","unstructured":"Canny, J., Reif, J.H.: New lower bound techniques for robot motion planning problems. In: Proc. IEEE Conf. Foundations Computer Science, pp. 49\u201360 (1987)","DOI":"10.1109\/SFCS.1987.42"},{"key":"82_CR6","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B. Chazelle","year":"1991","unstructured":"Chazelle, B.: Triangulating a simple polygon in linear time. Discrete Computational Geometry\u00a06, 485\u2013524 (1991)","journal-title":"Discrete Computational Geometry"},{"key":"82_CR7","first-page":"41","volume-title":"Approximate Euclidean shortest path in 3-space","author":"J. Choi","year":"1994","unstructured":"Choi, J., Sellen, J., Yap, C.-K.: Approximate Euclidean shortest path in 3-space. In Proc. ACM Conf. Computational Geometry, pp. 41\u201348. ACM Press, New York, NY, USA (1994)"},{"key":"82_CR8","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"D.S. Hochbaum","year":"1997","unstructured":"Hochbaum, D.S.: Approximation Algorithms for NP-Hard Problems. PWS Pub. Co., Boston (1997)"},{"key":"82_CR9","doi-asserted-by":"crossref","unstructured":"Klette, R., Kovalevsky, V.V., Yip, B.: Length estimation of digital curves. In: Proc. Vision Geometry, SPIE 3811, pp. 117\u2013129 (1999)","DOI":"10.1117\/12.364118"},{"key":"82_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/3-540-44438-6_38","volume-title":"Discrete Geometry for Computer Imagery","author":"R. Klette","year":"2000","unstructured":"Klette, R., B\u00fclow, T.: Critical edges in simple cube-curves. In: Nystr\u00f6m, I., Sanniti di Baja, G., Borgefors, G. (eds.) DGCI 2000. LNCS, vol.\u00a01953, pp. 467\u2013478. Springer, Heidelberg (2000)"},{"key":"82_CR11","volume-title":"Digital Geometry","author":"R. Klette","year":"2004","unstructured":"Klette, R., Rosenfeld, A.: Digital Geometry. Morgan Kaufmann, San Francisco (2004)"},{"key":"82_CR12","unstructured":"Li, F., Klette, R.: Exact and approximate algorithms for the calculation of shortest paths. In: Platinum Jubilee Conference of The Indian Statistical Institute. IEEE Conference, Kolkata, Report 2141 on www.ima.umn.edu\/preprints\/oct2006"},{"key":"82_CR13","doi-asserted-by":"crossref","unstructured":"Li., F., Klette, R.: Rubberband algorithms for solving various 2D or 3D shortest path problems. In: Proc. Computing: Theory Applications, plenary talk, pp. 9\u201319 (2007)","DOI":"10.1109\/ICCTA.2007.113"},{"key":"82_CR14","doi-asserted-by":"crossref","unstructured":"Mitchell, J.S.B., Sharir, M.: New results on shortest paths in three dimensions. In: Proc. SCG, pp. 124\u2013133 (2004)","DOI":"10.1145\/997817.997839"},{"key":"82_CR15","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0020-0190(85)90029-8","volume":"20","author":"C.H. Papadimitriou","year":"1985","unstructured":"Papadimitriou, C.H.: An algorithm for shortest path motion in three dimensions. Inform. Process. Lett.\u00a020, 259\u2013263 (1985)","journal-title":"Inform. Process. Lett."},{"key":"82_CR16","first-page":"21","volume":"9","author":"M. Talbot","year":"2004","unstructured":"Talbot, M.: A dynamical programming solution for shortest path itineraries in robotics. Electr. J. Undergrad. Math.\u00a09, 21\u201335 (2004)","journal-title":"Electr. J. Undergrad. Math."}],"container-title":["Lecture Notes in Computer Science","Computer Analysis of Images and Patterns"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74272-2_82.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:20:32Z","timestamp":1605763232000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74272-2_82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540742715","9783540742722"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74272-2_82","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}