{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:34:43Z","timestamp":1767339283985},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0925-7721(02)00135-9","type":"journal-article","created":{"date-parts":[[2003,2,28]],"date-time":"2003-02-28T09:00:13Z","timestamp":1046422813000},"page":"161-170","source":"Crossref","is-referenced-by-count":3,"title":["Building bridges between convex regions"],"prefix":"10.1016","volume":"25","author":[{"given":"Hee-Kap","family":"Ahn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Otfried","family":"Cheong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chan-Su","family":"Shin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(02)00135-9_BIB001","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0166-218X(94)90008-6","article-title":"Approximation algorithms for the geometric covering salesman problem","volume":"55","author":"Arkin","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0925-7721(02)00135-9_BIB002","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0020-0190(00)00228-3","article-title":"On computing the optimal bridge between two convex polygons","volume":"79","author":"Bhattacharya","year":"2001","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0925-7721(02)00135-9_BIB003","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0020-0190(99)00003-4","article-title":"Computing the optimal bridge between two convex polygons","volume":"69","author":"Cai","year":"1999","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0925-7721(02)00135-9_BIB004","series-title":"Proc. 12th Symp. on Discrete Algorithms","first-page":"38","article-title":"Approximation algorithms for TSP with neighborhoods in the plane","author":"Dumitrescu","year":"2001"},{"key":"10.1016\/S0925-7721(02)00135-9_BIB005","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1137\/0215052","article-title":"On a multidimensional search technique and its application to the Euclidean one-centre problem","volume":"15","author":"Dyer","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(02)00135-9_BIB006","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1137\/0220060","article-title":"Minimum diameter spanning trees and related problems","volume":"20","author":"Ho","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(02)00135-9_BIB007","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s00224-001-1018-2","article-title":"Computing the optimal bridge between two polygons","volume":"34","author":"Kim","year":"2001","journal-title":"Theory of Computing Systems"},{"key":"10.1016\/S0925-7721(02)00135-9_BIB008","series-title":"Proc. 11th Annu. ACM Sympos. Comput. Geom.","first-page":"360","article-title":"Approximation algorithms for geometric tour and network design problems","author":"Mata","year":"1995"},{"key":"10.1016\/S0925-7721(02)00135-9_BIB009","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","article-title":"Applying parallel computation algorithms in the design of serial algorithms","volume":"30","author":"Megiddo","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/S0925-7721(02)00135-9_BIB010","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/S0925-7721(02)00135-9_BIB011","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0020-0190(00)00143-5","article-title":"On optimal bridges between two convex regions","volume":"76","author":"Tan","year":"2000","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0925-7721(02)00135-9_BIB012","series-title":"Proc. 33rd Annu. ACM Sympos. Theory Comput.","first-page":"75","article-title":"Minimax parametric optimization problems and multi-dimensional parametric searching","author":"Tokuyama","year":"2001"},{"key":"10.1016\/S0925-7721(02)00135-9_BIB013","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0020-0190(00)00229-5","article-title":"An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons","volume":"79","author":"Wang","year":"2001","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0925-7721(02)00135-9_BIB014","series-title":"New Results and New Trends in Computer Science","first-page":"359","article-title":"Smallest enclosing disks (balls and ellipsoids)","volume":"555","author":"Welzl","year":"1991"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772102001359?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772102001359?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T07:52:47Z","timestamp":1553673167000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772102001359"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0925772102001359"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(02)00135-9","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}