{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T10:46:04Z","timestamp":1725705964585},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642347313"},{"type":"electronic","value":"9783642347320"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34732-0_1","type":"book-chapter","created":{"date-parts":[[2012,11,14]],"date-time":"2012-11-14T14:32:34Z","timestamp":1352903554000},"page":"1-15","source":"Crossref","is-referenced-by-count":4,"title":["On Finding Shortest Isothetic Path inside a Digital Object"],"prefix":"10.1007","author":[{"given":"Mousumi","family":"Dutt","sequence":"first","affiliation":[]},{"given":"Arindam","family":"Biswas","sequence":"additional","affiliation":[]},{"given":"Partha","family":"Bhowmick","sequence":"additional","affiliation":[]},{"given":"Bhargab B.","family":"Bhattacharya","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"1_CR1","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1109\/34.57681","volume":"12","author":"A.A. Amini","year":"1990","unstructured":"Amini, A.A., Weymouth, T.E., Jain, R.C.: Using dynamic programming for solving variational problems in vision. IEEE Trans. PAMI\u00a012(9), 855\u2013867 (1990)","journal-title":"IEEE Trans. PAMI"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0020-0190(02)00502-1","volume":"86","author":"E. Arkin","year":"2003","unstructured":"Arkin, E., Mitchell, J., Piatko, C.: Minimum-link watchman tours. IPL\u00a086, 203\u2013207 (2003)","journal-title":"IPL"},{"issue":"1","key":"1_CR3","first-page":"13","volume":"1","author":"M. Berg de","year":"1991","unstructured":"de Berg, M.: On rectilinear link distance. CGTA\u00a01(1), 13\u201334 (1991)","journal-title":"CGTA"},{"key":"1_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry Algorithms and Applications","author":"M. Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry Algorithms and Applications. Springer, Heidelberg (2008)"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-52846-6_91","volume-title":"SWAT \u201990","author":"M. Berg de","year":"1990","unstructured":"de Berg, M., van Kreveld, M., Nilsson, B.J., Overmars, M.H.: Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L 1 and Link Metric. In: Gilbert, J.R., Karlsson, R. (eds.) SWAT 1990. LNCS, vol.\u00a0447, pp. 213\u2013224. Springer, Heidelberg (1990)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1007\/11499145_94","volume-title":"Image Analysis","author":"A. Biswas","year":"2005","unstructured":"Biswas, A., Bhowmick, P., Bhattacharya, B.B.: TIPS: On Finding a Tight Isothetic Polygonal Shape Covering a 2D Object. In: Kalviainen, H., Parkkinen, J., Kaarna, A. (eds.) SCIA 2005. LNCS, vol.\u00a03540, pp. 930\u2013939. Springer, Heidelberg (2005)"},{"issue":"4","key":"1_CR7","first-page":"295","volume":"21","author":"A. Biswas","year":"2010","unstructured":"Biswas, A., Bhowmick, P., Bhattacharya, B.B.: Construction of isothetic covers of a digital object: A combinatorial approach. JVCIR\u00a021(4), 295\u2013310 (2010)","journal-title":"JVCIR"},{"issue":"7","key":"1_CR8","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1016\/S0167-8655(97)00076-7","volume":"18","author":"M. Buckley","year":"1997","unstructured":"Buckley, M., Yang, J.: Regularised shortest-path extraction. PRL\u00a018(7), 621\u2013629 (1997)","journal-title":"PRL"},{"issue":"3","key":"1_CR9","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0020-0255(92)90072-G","volume":"63","author":"W.P. Chin","year":"1992","unstructured":"Chin, W.P., Ntafos, S.: The zookeeper route problem. Information Sc.\u00a063(3), 245\u2013259 (1992)","journal-title":"Information Sc."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Kapoor, S., Vaidya, P.: Rectilinear shortest paths through polygonal obstacles in O(n (logn)2) time. In: Proc. SCG, pp. 251\u2013257 (1987)","DOI":"10.1145\/41958.41985"},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/0022-0000(89)90043-3","volume":"39","author":"J.C. Culberson","year":"1989","unstructured":"Culberson, J.C., Reckhow, R.A.: Orthogonally convex coverings of orthogonal polygons without holes. J. Computer and Sys. Sc.\u00a039(2), 166\u2013204 (1989)","journal-title":"J. Computer and Sys. Sc."},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0196-6774(03)00047-6","volume":"48","author":"A. Dumitrescu","year":"2003","unstructured":"Dumitrescu, A., Mitchell, J.S.B.: Approximation algorithms for TSP with neighborhoods in the plane. J. Algorithms\u00a048(1), 135\u2013159 (2003)","journal-title":"J. Algorithms"},{"key":"1_CR13","unstructured":"Farin, G., Hoschek, J., Kim, M.S.: Handbook of Computer Aided Geometric Design. Elsevier (2002)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511543340"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/3-540-48686-0_47","volume-title":"Computing and Combinatorics","author":"J. Gudmundsson","year":"1999","unstructured":"Gudmundsson, J., Levcopoulos, C.: A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol.\u00a01627, pp. 473\u2013482. Springer, Heidelberg (1999)"},{"key":"1_CR16","first-page":"873","volume":"42","author":"R. Inkula","year":"2009","unstructured":"Inkula, R., Kapoor, S.: Planar rectilinear shortest path computation using corridors. CGTA\u00a042, 873\u2013884 (2009)","journal-title":"CGTA"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Klette, R., Rosenfeld, A.: Digital Geometry: Geometric Methods for Picture Analysis. Morgan Kaufmann (2004)","DOI":"10.1016\/B978-155860861-0\/50005-5"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1002\/net.3230110307","volume":"11","author":"R.C. Larson","year":"1981","unstructured":"Larson, R.C., Li, V.O.: Finding minimum rectilinear distance paths in the presence of barriers. Networks\u00a011, 285\u2013304 (1981)","journal-title":"Networks"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/11949534_28","volume-title":"Advances in Image and Video Technology","author":"F. Li","year":"2006","unstructured":"Li, F., Klette, R.: Finding the Shortest Path Between Two Points in a Simple Polygon by Applying a Rubberband Algorithm. In: Chang, L.-W., Lie, W.-N. (eds.) PSIVT 2006. LNCS, vol.\u00a04319, pp. 280\u2013291. Springer, Heidelberg (2006)"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1109\/TPAMI.2007.41","volume":"29","author":"H. Ling","year":"2007","unstructured":"Ling, H., Jacobs, D.W.: Shape classification using the inner-distance. IEEE Trans. PAMI\u00a029, 286\u2013299 (2007)","journal-title":"IEEE Trans. PAMI"},{"issue":"10","key":"1_CR21","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/359156.359164","volume":"22","author":"P.T. Lozano","year":"1979","unstructured":"Lozano, P.T., Wesley, M.A.: An algorithm for planning collision-free paths among polyhedral obstacles. Magazine Comm. ACM\u00a022(10), 560\u2013570 (1979)","journal-title":"Magazine Comm. ACM"},{"key":"1_CR22","first-page":"149","volume":"1","author":"S. Ntafos","year":"1992","unstructured":"Ntafos, S.: Watchman routes under limited visibility. CGTA\u00a01, 149\u2013170 (1992)","journal-title":"CGTA"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"de Resende, P.J., Lee, D.T., Wu, Y.F.: Rectilinear shortest paths with rectangular barriers. In: Proc. SCG, pp. 204\u2013213 (1985)","DOI":"10.1145\/323233.323260"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Sharir, M., Schorr, A.: On shortest paths in polyhedral spaces. In: Proc. STOC, pp. 193\u2013215 (1986)","DOI":"10.1137\/0215014"},{"issue":"3","key":"1_CR25","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1016\/S0031-3203(02)00085-7","volume":"36","author":"C. Sun","year":"2003","unstructured":"Sun, C., Pallottino, S.: Circular shortest path in images. PR\u00a036(3), 709\u2013719 (2003)","journal-title":"PR"},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0166-218X(03)00451-7","volume":"136","author":"X. Tan","year":"2004","unstructured":"Tan, X.: Approximation algorithms for the watchman route and zookeeper\u2019s problems. Discrete App. Maths.\u00a0136, 363\u2013376 (2004)","journal-title":"Discrete App. Maths."},{"issue":"4","key":"1_CR27","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0020-0190(03)00284-9","volume":"87","author":"X. Tan","year":"2003","unstructured":"Tan, X., Hirata, T.: Finding shortest safari routes in simple polygons. IPL\u00a087(4), 179\u2013186 (2003)","journal-title":"IPL"},{"key":"1_CR28","unstructured":"Wei, X.: Monotone path queries and monotone subdivision problems in polygonal domains. Ph.D. thesis, Hong Kong Univ. Sc. & Tech. (2010)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Image Analaysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34732-0_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:03:57Z","timestamp":1620133437000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34732-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642347313","9783642347320"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34732-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}