{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:15:52Z","timestamp":1777644952765,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2018,3,7]],"date-time":"2018-03-07T00:00:00Z","timestamp":1520380800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2018,3,7]]},"abstract":"<jats:p>\n                    This article presents a combinatorial algorithm to find a shortest triangular path (STP) between two points inside a digital object imposed on triangular grid that runs in [Formula: see text] time, where n is the number of pixels on the contour of the object and g is the grid size. Initially, the inner triangular cover which maximally inscribes the object is constructed to ensure that the path lies within the object. An appropriate bounding parallelogram is considered with those two points in diagonally opposite corners and then one of the semi-perimeters of the parallelogram is traversed. Certain combinatorial rules are formulated based on the properties of triangular grid and are applied during the traversal whenever required to shorten the triangular path. A shortest triangular path between any two points may not be unique. Another combinatorial algorithm is presented, which finds the family of shortest triangular path (FSTP) (i.e., the region containing all possible shortest triangular paths) between two given points inside a digital object and runs in [Formula: see text] time. Experimental results are presented to verify the correctness, robustness, and efficacy of the algorithms. STP and FSTP can be useful for shape analysis of digital objects and determining shape signatures.\n                    <jats:sup>1<\/jats:sup>\n                  <\/jats:p>","DOI":"10.3233\/fi-2018-1666","type":"journal-article","created":{"date-parts":[[2018,3,9]],"date-time":"2018-03-09T11:02:01Z","timestamp":1520593321000},"page":"297-325","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":3,"title":["Finding Shortest Triangular Path and its Family inside a Digital Object"],"prefix":"10.1177","volume":"159","author":[{"given":"Apurba","family":"Sarkar","sequence":"first","affiliation":[{"name":"Department of Computer Science and Technology, Indian Institute of Engineering Science and Technology, Shibpur, India."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arindam","family":"Biswas","sequence":"additional","affiliation":[{"name":"Department of Information Technology, Indian Institute of Engineering Science and Technology, Shibpur, India."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mousumi","family":"Dutt","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, St. Thomas College of Engineering and Technology, Kolkata, India."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shouvick","family":"Mondal","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology, Madras, India."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2018,3,7]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2018-1666","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2018-1666","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:30:53Z","timestamp":1777444253000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2018-1666"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,7]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,3,7]]}},"alternative-id":["10.3233\/FI-2018-1666"],"URL":"https:\/\/doi.org\/10.3233\/fi-2018-1666","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,7]]}}}