{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:38:09Z","timestamp":1725853089213},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319323596"},{"type":"electronic","value":"9783319323602"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-32360-2_16","type":"book-chapter","created":{"date-parts":[[2016,4,8]],"date-time":"2016-04-08T23:15:41Z","timestamp":1460157341000},"page":"206-218","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Finding Shortest Triangular Path in a Digital Object"],"prefix":"10.1007","author":[{"given":"Apurba","family":"Sarkar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arindam","family":"Biswas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shouvick","family":"Mondal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mousumi","family":"Dutt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,9]]},"reference":[{"key":"16_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice Hall, Upper Saddle River (1993)"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Balint, G.T., Nagy, B.: Finiteness of chain-code picture languages on the triangular grid. In: Image and Signal Processing and Analysis (ISPA), pp. 310\u2013315 (2015)","DOI":"10.1109\/ISPA.2015.7306078"},{"key":"16_CR3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R Bellman","year":"1958","unstructured":"Bellman, R.: On a routing problem. Q. Appl. Math. 16, 87\u201390 (1958)","journal-title":"Q. Appl. Math."},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-319-07148-0_8","volume-title":"Combinatorial Image Analysis","author":"B Das","year":"2014","unstructured":"Das, B., Dutt, M., Biswas, A., Bhowmick, P., Bhattacharya, B.B.: A combinatorial technique for construction of triangular covers of digital objects. In: Barneva, R.P., Brimkov, V.E., \u0160lapal, J. (eds.) IWCIA 2014. LNCS, vol. 8466, pp. 76\u201390. Springer, Heidelberg (2014)"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E Dijkstra","year":"1959","unstructured":"Dijkstra, E.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10472-014-9421-y","volume":"75","author":"M Dutt","year":"2015","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. 75, 27\u201351 (2015)","journal-title":"Ann. Math. Artif. Intell."},{"key":"16_CR7","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":"16_CR8","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1109\/TC.1979.1675305","volume":"28","author":"H Freeman","year":"1979","unstructured":"Freeman, H.: Algorithm for generating a digital straight line on a triangular grid. IEEE Trans. Comput. 28, 150\u2013152 (1979)","journal-title":"IEEE Trans. Comput."},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1109\/83.413166","volume":"4","author":"I Her","year":"1995","unstructured":"Her, I.: Geometric transformation on the hexagonal grid. IEEE Trans. Image Process. 4, 1213\u20131222 (1995)","journal-title":"IEEE Trans. Image Process."},{"issue":"5","key":"16_CR10","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1109\/TC.1976.1674642","volume":"25","author":"E Luczak","year":"1976","unstructured":"Luczak, E., Rosenfeld, A.: Distance on a hexagonal grid. IEEE Trans. Comput. 25(5), 532\u2013533 (1976)","journal-title":"IEEE Trans. Comput."},{"key":"16_CR11","unstructured":"Moore, E.: The shortest path through a maze. In: Proceedings of an International Symposium on the Theory of Switching, 25 April 1957, pp. 285\u2013292. Harvard University Press, Cambridge (1959)"},{"issue":"2","key":"16_CR12","doi-asserted-by":"crossref","first-page":"111","DOI":"10.2498\/cit.2003.02.04","volume":"11","author":"B Nagy","year":"2003","unstructured":"Nagy, B.: Shortest paths in triangular grids with neighbourhood sequences. J. Comput. Inf. Technol. 11(2), 111\u2013122 (2003)","journal-title":"J. Comput. Inf. Technol."},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Schrijver, A.: On the history of the shortest path problem. Doc. Math. 155\u2013167 (2012)","DOI":"10.4171\/dms\/6\/19"},{"issue":"4","key":"16_CR14","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/BF02476438","volume":"15","author":"A Shimbel","year":"1953","unstructured":"Shimbel, A.: Structural parameters of communication networks. Bull. Math. Biophys. 15(4), 501\u2013507 (1953)","journal-title":"Bull. Math. Biophys."}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry for Computer Imagery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32360-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T14:49:58Z","timestamp":1692283798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32360-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319323596","9783319323602"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32360-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}