{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:25:18Z","timestamp":1742912718015,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642341908"},{"type":"electronic","value":"9783642341915"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34191-5_5","type":"book-chapter","created":{"date-parts":[[2012,11,11]],"date-time":"2012-11-11T19:57:47Z","timestamp":1352663867000},"page":"54-64","source":"Crossref","is-referenced-by-count":3,"title":["Open Guard Edges and Edge Guards in Simple Polygons"],"prefix":"10.1007","author":[{"given":"Csaba D.","family":"T\u00f3th","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Godfried T.","family":"Toussaint","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Winslow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/BF01952419","volume":"2","author":"D. Avis","year":"1986","unstructured":"Avis, D., Gum, T., Toussaint, G.T.: Visibility between two edges of a simple polygon. The Visual Computer\u00a02, 342\u2013357 (1986)","journal-title":"The Visual Computer"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1109\/TC.1981.1675729","volume":"C-30","author":"D. Avis","year":"1981","unstructured":"Avis, D., Toussaint, G.: An optimal algorithm for determining the visibility of a polygon from an edge. IEEE Tran. Comput.\u00a0C-30, 910\u2013914 (1981)","journal-title":"IEEE Tran. Comput."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0925-7721(01)00058-X","volume":"23","author":"B.K. Bhattacharya","year":"2002","unstructured":"Bhattacharya, B.K., Das, G., Mukhopadhyay, A., Narasimhan, G.: Optimally computing a shortest weakly visible line segment inside a simple polygon. Comput. Geom. Theory Appl.\u00a023, 1\u201329 (2002)","journal-title":"Comput. Geom. Theory Appl."},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1006\/jagm.1996.0023","volume":"20","author":"D.Z. Chen","year":"1996","unstructured":"Chen, D.Z.: Optimally computing the shortest weakly visible subedge of a simple polygon. J.\u00a0Algorithms\u00a020, 459\u2013478 (1996)","journal-title":"J.\u00a0Algorithms"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(75)90061-1","volume":"28","author":"V. Chv\u00e1tal","year":"1975","unstructured":"Chv\u00e1tal, V.: A combinatorial theorem in plane geometry. J. Combin. Theory Ser. B\u00a028, 39\u201341 (1975)","journal-title":"J. Combin. Theory Ser. B"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1145\/322139.322142","volume":"26","author":"D.T. Lee","year":"1979","unstructured":"Lee, D.T., Preparata, F.: An optimal algorithm for finding the kernel of a polygon. J. ACM\u00a026, 415\u2013421 (1979)","journal-title":"J. ACM"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0304-3975(00)00235-8","volume":"263","author":"B.-K. Lu","year":"2001","unstructured":"Lu, B.-K., Hsu, F.-R., Tang, C.Y.: Finding the shortest boundary guard of a simple polygon. Theor. Comp. Sci.\u00a0263, 113\u2013121 (2001)","journal-title":"Theor. Comp. Sci."},{"key":"5_CR8","first-page":"273","volume":"14","author":"J. O\u2019Rourke","year":"1983","unstructured":"O\u2019Rourke, J.: Galleries need fewer mobile guards: A variation on Chv\u00e1tal\u2019s theorem. Geometriae Dedicata\u00a014, 273\u2013283 (1983)","journal-title":"Geometriae Dedicata"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/BF02573990","volume":"10","author":"J. Park","year":"1993","unstructured":"Park, J., Shin, S.Y., Chwa, K., Woo, T.C.: On the number of guard edges of a polygon. Discrete Comput. Geom.\u00a010, 447\u2013462 (1993)","journal-title":"Discrete Comput. Geom."},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1109\/5.163407","volume":"80","author":"T.C. Shermer","year":"1992","unstructured":"Shermer, T.C.: Recent results in art galleries. Proc. IEEE\u00a080, 1384\u20131399 (1992)","journal-title":"Proc. IEEE"},{"key":"5_CR11","first-page":"191","volume":"3","author":"T.C. Shermer","year":"1994","unstructured":"Shermer, T.C.: A tight bound on the combinatorial edge guarding problem. Snapshots of Comp. and Discrete Geom.\u00a03, 191\u2013223 (1994)","journal-title":"Snapshots of Comp. and Discrete Geom."},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1109\/70.88040","volume":"5","author":"S.Y. Shin","year":"1989","unstructured":"Shin, S.Y., Woo, T.: An optimal algorithm for finding all visible edges in a simple polygon. IEEE Tran. Robotics and Automation\u00a05, 202\u2013207 (1989)","journal-title":"IEEE Tran. Robotics and Automation"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0020-0190(00)00146-0","volume":"77","author":"X. Tan","year":"2001","unstructured":"Tan, X.: Fast computation of shortest watchman routes in simple polygons. Inf. Proc. Lett.\u00a077, 27\u201333 (2001)","journal-title":"Inf. Proc. Lett."},{"key":"5_CR14","unstructured":"Viglietta, G.: Searching polyhedra by rotating planes, manuscript, arXiv:1104.4137 (2011)"}],"container-title":["Lecture Notes in Computer Science","Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34191-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:07:36Z","timestamp":1558300056000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34191-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341908","9783642341915"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34191-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}