{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:43:53Z","timestamp":1759063433896},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[1999,12]]},"abstract":"<jats:p> This paper presents a simple O(n+k) time algorithm to compute the set of knon-crossing shortest paths between k source-destination pairs of points on the boundary of a simple polygon of n vertices. Paths are allowed to overlap but are not allowed to cross in the plane. A byproduct of this result is an O(n) time algorithm to compute a balanced geodesic triangulation which is easy to implement. The algorithm extends to a simple polygon with one hole where source-destination pairs may appear on both the inner and outer boundary of the polygon. In the latter case, the goal is to compute a collection of non-crossing paths of minimum total cost. The case of a rectangular polygonal domain where source-destination pairs appear on the outer and one inner boundary<jats:sup>12<\/jats:sup> is briefly discussed. <\/jats:p>","DOI":"10.1142\/s0218195999000315","type":"journal-article","created":{"date-parts":[[2003,5,22]],"date-time":"2003-05-22T06:35:01Z","timestamp":1053585301000},"page":"533-552","source":"Crossref","is-referenced-by-count":8,"title":["k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON"],"prefix":"10.1142","volume":"09","author":[{"given":"EVANTHIA","family":"PAPADOPOULOU","sequence":"first","affiliation":[{"name":"IBM TJ Watson Research Center, P.O.\u00a0Box 218, Yorktown Heights, NY\u00a010598, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"p_1","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1109\/SFCS.1982.58","author":"Chazelle B.","year":"1982","journal-title":"Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci."},{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01377183"},{"key":"p_3","first-page":"318","volume":"1993","author":"Goodrich M. T.","journal-title":"Proc. Geom}"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90041-X"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840360"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(94)90010-8"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140304"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90012-X"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01955681"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195997000259"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195999000315","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:38:29Z","timestamp":1565192309000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195999000315"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,12]]},"references-count":10,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1999,12]]}},"alternative-id":["10.1142\/S0218195999000315"],"URL":"https:\/\/doi.org\/10.1142\/s0218195999000315","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,12]]}}}