{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:02Z","timestamp":1725664082637},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582182"},{"type":"electronic","value":"9783540485773"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58218-5_11","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:37:06Z","timestamp":1330252626000},"page":"119-130","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Finding all weakly-visible chords of a polygon in linear time"],"prefix":"10.1007","author":[{"given":"Gautam","family":"Das","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul J.","family":"Heffernan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giri","family":"Narasimhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1109\/TC.1981.1675729","volume":"30","author":"D. Avis","year":"1981","unstructured":"Avis, D., Toussaint, G.T.: An optimal algorithm for determining the visibility of a polygon from an edge. IEEE Transactions on Computers 30 (1981) 910\u2013914","journal-title":"IEEE Transactions on Computers"},{"key":"11_CR2","first-page":"323","volume":"762","author":"D. Z. Chen","year":"1993","unstructured":"Chen, D.Z.: Optimally computing the shortest weakly-visible edge of a simple polygon. Proc. Fourth ISAAC, LNCS 762 (1993) 323\u2013332","journal-title":"LNCS"},{"issue":"1","key":"11_CR3","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1006\/jagm.1993.1007","volume":"14","author":"J. Doh","year":"1993","unstructured":"Doh, J., Chwa, K.: An algorithm for determining visibility of a simple polygon from an Internal Line Segment. J. of Algorithms 14(1) (1993) 139\u2013168","journal-title":"J. of Algorithms"},{"key":"11_CR4","unstructured":"Das, D., Heffernan, P.J., Narasimhan, G.: LR-visibility in polygons. Proc. 5th Canadian Conference on Computational Geometry (1993) 303\u2013308. Submitted to special issue of Computational Geometry \u2014 Theory and Appln."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Das, G., Narasimhan, G.: Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon. Proc. 10th Annual ACM Symp. on Computational Geometry (1994)","DOI":"10.1145\/177424.177984"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L. Guibas","year":"1987","unstructured":"Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.: Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2 (1987) 209\u2013233","journal-title":"Algorithmica"},{"key":"11_CR7","unstructured":"Heffernan, P.J.: An optimal algorithm for the two-guard problem. Proc. 9th Annual ACM Symp. on Computational Geometry (1993) 348\u2013358"},{"key":"11_CR8","unstructured":"Icking, C., Klein, R.: The two guards problem. Proc. 7th Annual ACM Symp. on Computational Geometry (1991) 166\u2013175"},{"key":"11_CR9","unstructured":"Ke, Y.: Detecting the weak visibility of a simple polygon and related problems. Tech. Report, The Johns Hopkins University (1987)"},{"issue":"3","key":"11_CR10","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1145\/322139.322142","volume":"26","author":"D. T. Lee","year":"1979","unstructured":"Lee, D.T., Preparata, F.P.: An optimal algorithm for finding the kernel of a polygon. Journal of the ACM, 26(3) (1979) 415\u2013421","journal-title":"Journal of the ACM"},{"issue":"10","key":"11_CR11","doi-asserted-by":"crossref","first-page":"1213","DOI":"10.1109\/12.59852","volume":"39","author":"J.-R. Sack","year":"1990","unstructured":"Sack, J.-R., Suri, S.: An optimal algorithm for detecting weak visibility. IEEE Transactions on Computers 39(10) (1990) 1213\u20131219","journal-title":"IEEE Transactions on Computers"},{"key":"11_CR12","unstructured":"Tseng, L.H., Lee, D.T.: Two-guard walkability of simple polygons. manuscript (1993)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT '94"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58218-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:02:30Z","timestamp":1578517350000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58218-5_11"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582182","9783540485773"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-58218-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"30 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}