{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T08:01:14Z","timestamp":1767168074772,"version":"build-2238731810"},"reference-count":16,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[2000,4]]},"abstract":"<jats:p>\n                    A central link segment of a simple n-vertex polygon P is a segment s inside P that minimizes the quantity max\n                    <jats:sub>x\u2208P<\/jats:sub>\n                    min\n                    <jats:sub>y\u2208s<\/jats:sub>\n                    d\n                    <jats:sub>L<\/jats:sub>\n                    (x,y), where d\n                    <jats:sub>L<\/jats:sub>\n                    (x,y) is the link distance between points x and y of P. In this paper we present an O (n log n) algorithm for finding a central link segment of P. This generalizes previous results for finding an edge or a segment of P from which P is visible. Moreover, in the same time bound, our algorithm finds a central link segment of minimum length. Constructing a central link segment has applications to the problems of finding an optimal robot placement in a simply connected polygonal region and determining the minimum value k for which a given polygon is k-visible from some segment.\n                  <\/jats:p>","DOI":"10.1142\/s0218195900000103","type":"journal-article","created":{"date-parts":[[2003,5,7]],"date-time":"2003-05-07T04:18:55Z","timestamp":1052281135000},"page":"157-188","source":"Crossref","is-referenced-by-count":1,"title":["An O(n\n                    <font>log<\/font>\n                    n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT"],"prefix":"10.1142","volume":"10","author":[{"given":"LYUDMIL G.","family":"ALEKSANDROV","sequence":"first","affiliation":[{"name":"Bulgarian Academy of Sciences, CICT, Acad. G. Bonchev Str., Bl. 25-A, 1113 Sofia, Bulgaria"}]},{"given":"HRISTO N.","family":"DJIDJEV","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Warwick, Coventry, CV4 7AL, England, UK"}]},{"given":"J\u00d6RG-R\u00dcDIGER","family":"SACK","sequence":"additional","affiliation":[{"name":"School of Computer Science, Carleton University, Ottawa, Ontario K1S 5B6, Canada"}]}],"member":"219","published-online":{"date-parts":[[2012,4,30]]},"reference":[{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1981.1675729"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195995000234"},{"key":"p_4","first-page":"88","author":"Bhattacharya B.","year":"1991","journal-title":"Proceedings of the Third Canadian Conference on Computational Geometry"},{"key":"p_7","first-page":"519","author":"Djidjev H.","year":"2000","journal-title":"Amsterdam"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1993.1007"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840360"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195993000257"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195991000025"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90041-X"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1145\/73833.73841"},{"key":"p_18","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187913"},{"key":"p_19","doi-asserted-by":"publisher","DOI":"10.1007\/BF01206332"},{"key":"p_21","doi-asserted-by":"publisher","DOI":"10.3138\/3535-7609-781G-4L20"},{"key":"p_24","doi-asserted-by":"publisher","DOI":"10.1109\/JRA.1987.1087092"},{"key":"p_25","doi-asserted-by":"publisher","DOI":"10.1109\/12.59852"},{"key":"p_27","doi-asserted-by":"publisher","DOI":"10.1137\/0216030"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195900000103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T08:28:27Z","timestamp":1565080107000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195900000103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":16,"aliases":["10.1016\/s0218-1959(00)00010-3"],"journal-issue":{"issue":"02","published-online":{"date-parts":[[2012,4,30]]},"published-print":{"date-parts":[[2000,4]]}},"alternative-id":["10.1142\/S0218195900000103"],"URL":"https:\/\/doi.org\/10.1142\/s0218195900000103","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,4]]}}}