{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:08:56Z","timestamp":1742922536744,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319199405"},{"type":"electronic","value":"9783319199412"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19941-2_11","type":"book-chapter","created":{"date-parts":[[2015,6,21]],"date-time":"2015-06-21T23:07:32Z","timestamp":1434928052000},"page":"105-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Enumeration of Shortest Isothetic Paths Inside a Digital Object"],"prefix":"10.1007","author":[{"given":"Mousumi","family":"Dutt","sequence":"first","affiliation":[]},{"given":"Arindam","family":"Biswas","sequence":"additional","affiliation":[]},{"given":"Bhargab B.","family":"Bhattacharya","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,23]]},"reference":[{"key":"11_CR1","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. Inf. Process. Lett. 86, 203\u2013207 (2003)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0925-7721(91)90010-C","volume":"1","author":"M Berg de","year":"1991","unstructured":"de Berg, M.: On rectilinear link distance. Comput. Geom. Theor. Appl. 1(1), 13\u201334 (1991)","journal-title":"Comput. Geom. Theor. Appl."},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/3-540-52846-6_91","volume-title":"SWAT 1990","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 \n                      \n                        \n                      \n                      $$L_1$$\n                     and link metric. In: Gilbert, J.R., Karlsson, R. (eds.) SWAT 1990. LNCS, vol. 447, pp. 213\u2013224. Springer, Heidelberg (1990)"},{"key":"11_CR4","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. 3540, pp. 930\u2013939. Springer, Heidelberg (2005)"},{"issue":"4","key":"11_CR5","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.jvcir.2010.02.001","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. J. Vis. Commun. Image Represent. 21(4), 295\u2013310 (2010)","journal-title":"J. Vis. Commun. Image Represent."},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0020-0255(92)90072-G","volume":"63","author":"WP Chin","year":"1992","unstructured":"Chin, W.P., Ntafos, S.: The zookeeper route problem. Inf. Sci. 63(3), 245\u2013259 (1992)","journal-title":"Inf. Sci."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Kapoor, S., Vaidya, P.: Rectilinear shortest paths through polygonal obstacles in \n                      \n                        \n                      \n                      $$O(n (\\log n)^2)$$\n                     time. In: SoCG 1987, pp. 251\u2013257. ACM, NY (1987)","DOI":"10.1145\/41958.41985"},{"key":"11_CR8","volume-title":"Basic Techniques of Combinatorial Theory","author":"DIA Cohen","year":"2007","unstructured":"Cohen, D.I.A.: Basic Techniques of Combinatorial Theory. Wiley, NY (2007)"},{"issue":"2","key":"11_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0167-8655(89)90043-3","volume":"9","author":"PP Das","year":"1989","unstructured":"Das, P.P.: An algorithm for computing the number of the minimal paths in digital images. Pattern Recognit. Lett. 9(2), 107\u2013116 (1989)","journal-title":"Pattern Recognit. Lett."},{"issue":"10","key":"11_CR10","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/0167-8655(91)90013-C","volume":"12","author":"PP Das","year":"1991","unstructured":"Das, P.P.: Counting minimal paths in digital geometry. Pattern Recognit. Lett. 12(10), 595\u2013603 (1991)","journal-title":"Pattern Recognit. Lett."},{"issue":"1","key":"11_CR11","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 48(1), 135\u2013159 (2003)","journal-title":"J. Algorithms"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-34732-0_1","volume-title":"Combinatorial Image Analaysis","author":"M Dutt","year":"2012","unstructured":"Dutt, M., Biswas, A., Bhowmick, P., Bhattacharya, B.B.: On finding shortest isothetic path inside a digital object. In: Barneva, R.P., Brimkov, V.E., Aggarwal, J.K. (eds.) IWCIA 2012. LNCS, vol. 7655, pp. 1\u201315. Springer, Heidelberg (2012)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Dutt, M., Biswas, A., Bhowmick, P., Bhattacharya, B.B.: On finding a shortest isothetic path and its monotonicity inside a digital object. Ann. Math. Artif. Intell. (2014, in press)","DOI":"10.1007\/s10472-014-9421-y"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.cviu.2014.07.001","volume":"129","author":"M Dutt","year":"2014","unstructured":"Dutt, M., Biswas, A., Bhowmick, P., Bhattacharya, B.B.: On the family of shortest isothetic paths in a digital object\u2014an algorithm with applications. Comput. Vis. Image Underst. 129, 75\u201388 (2014)","journal-title":"Comput. Vis. Image Underst."},{"key":"11_CR15","volume-title":"Digital Geometry: Geometric Methods for Picture Analysis","author":"R Klette","year":"2004","unstructured":"Klette, R., Rosenfeld, A.: Digital Geometry: Geometric Methods for Picture Analysis. Morgan Kaufmann, San Francisco (2004)"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1002\/net.3230110307","volume":"11","author":"RC Larson","year":"1981","unstructured":"Larson, R.C., Li, V.O.: Finding minimum rectilinear distance paths in the presence of barriers. Networks 11, 285\u2013304 (1981)","journal-title":"Networks"},{"key":"11_CR17","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. 4319, pp. 280\u2013291. Springer, Heidelberg (2006)"},{"issue":"10","key":"11_CR18","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/359156.359164","volume":"22","author":"T Lozano-Perez","year":"1979","unstructured":"Lozano-Perez, T., Wesley, M.A.: An algorithm for planning collision-free paths among polyhedral obstacles. CACM 22(10), 560\u2013570 (1979)","journal-title":"CACM"},{"issue":"4","key":"11_CR19","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. Inf. Process. Lett. 87(4), 179\u2013186 (2003)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19941-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T20:03:23Z","timestamp":1560110603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-19941-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319199405","9783319199412"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19941-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"23 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}