{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T08:56:46Z","timestamp":1775897806627,"version":"3.50.1"},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[1996,6]]},"abstract":"<jats:p> We present an algorithm for determining the shortest path between any two points along the surface of a polyhedron which need not be convex. This algorithm also computes for any source point on the surface of a polyhedron the inward layout and the subdivision of the polyhedron which can be used for processing queries of shortest paths between the source point and any destination point. Our algorithm uses a new approach which deviates from the conventional \u201ccontinuous Dijkstra\u201d technique. Our algorithm has time complexity O(n<jats:sup>2<\/jats:sup>) and space complexity \u0398(n). <\/jats:p>","DOI":"10.1142\/s0218195996000095","type":"journal-article","created":{"date-parts":[[2004,9,6]],"date-time":"2004-09-06T11:50:09Z","timestamp":1094471409000},"page":"127-144","source":"Crossref","is-referenced-by-count":83,"title":["SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS"],"prefix":"10.1142","volume":"06","author":[{"given":"JINDONG","family":"CHEN","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Kentucky, Lexington, KY 40506, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YIJIE","family":"HAN","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Kentucky, Lexington, KY 40506, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195996000095","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:31:06Z","timestamp":1565137866000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195996000095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":0,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1996,6]]}},"alternative-id":["10.1142\/S0218195996000095"],"URL":"https:\/\/doi.org\/10.1142\/s0218195996000095","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}