{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T19:02:27Z","timestamp":1758394947293},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642359255"},{"type":"electronic","value":"9783642359262"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35926-2_13","type":"book-chapter","created":{"date-parts":[[2012,12,20]],"date-time":"2012-12-20T23:32:11Z","timestamp":1356046331000},"page":"110-121","source":"Crossref","is-referenced-by-count":1,"title":["Touring Polygons: An Approximation Algorithm"],"prefix":"10.1007","author":[{"given":"Amirhossein","family":"Mozafari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alireza","family":"Zarei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Asano, T., Asano, T., Guibas, L., Hershberger, J., Imai, H.: Visibility-polygon search and Euclidean shortest paths. In: Proc. 26th IEEE Symposium on Foundations of Computer Science, pp. 155\u2013164 (1985)","DOI":"10.1109\/SFCS.1985.65"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Asano, T., Kirkpatrick, D., Yap, C.: Pseudo approximation algorithms, with applications to optimal motion planning. In: Proc. 18th Annu. ACM Sympos. Comput. Geom., pp. 170\u2013178 (2002)","DOI":"10.1145\/513400.513422"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Canny, J., Reif, J.H.: New lower bound techniques for robot motion planning problems. In: Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci, pp. 49\u201360 (1987)","DOI":"10.1109\/SFCS.1987.42"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF02574671","volume":"6","author":"W. Chin","year":"1991","unstructured":"Chin, W., Ntafos, S.: Shortest Watchman Routes in Simple Polygons. Discrete and Computational Geometry\u00a06(1), 9\u201331 (1991)","journal-title":"Discrete and Computational Geometry"},{"key":"13_CR5","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT press (2009) ISBN 978-0-262-03384-8"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Dror, M., Efrat, A., Lubiw, A., Mitchell, J.: Touring a sequence of polygons. In: Proc. STOC 2003, pp. 473\u2013482 (2003)","DOI":"10.1145\/780611.780612"},{"key":"13_CR7","first-page":"271","volume":"31","author":"M. Dror","year":"1999","unstructured":"Dror, M.: Polygon plate-cutting with a given order. IIE Transactions\u00a031, 271\u2013274 (1999)","journal-title":"IIE Transactions"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/0022-0000(89)90041-X","volume":"39","author":"L.J. Guibas","year":"1989","unstructured":"Guibas, L.J., Hershberger, J.: optimal shortest path queries in simple polygon. J. Comput. Syst. Sci.\u00a039, 126\u2013152 (1989)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR9","unstructured":"Hershberger, J., Snoeyink, J.: An efficient solution to the zookeeper\u2019s problem. In: Proc. 6th Canadian Conf. on Comp. Geometry, pp. 104\u2013109 (1994)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Li, F., Klette, R.: Rubberband algorithms for solving various 2D or 3D shortest path problems. In: Proc. Computing: Theory and Applications, The Indian Statistical Institute, Kolkata, pp. 9\u201318. IEEE (2007)","DOI":"10.1109\/ICCTA.2007.113"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/3-540-57568-5_236","volume-title":"Algorithms and Computation","author":"X. Tan","year":"1993","unstructured":"Tan, X., Hirata, T.: Constructing Shortest Watchman Routes by Divide and Conquer. In: Ng, K.W., Balasubramanian, N.V., Raghavan, P., Chin, F.Y.L. (eds.) ISAAC 1993. LNCS, vol.\u00a0762, pp. 68\u201377. Springer, Heidelberg (1993)"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/3-540-58325-4_219","volume-title":"Algorithms and Computation","author":"X. Tan","year":"1994","unstructured":"Tan, X., Hirata, T.: Shortest Safari Routes in Simple Polygons. In: Du, D.-Z., Zhang, X.-S. (eds.) ISAAC 1994. LNCS, vol.\u00a0834, pp. 523\u2013531. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35926-2_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T09:33:45Z","timestamp":1620120825000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35926-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642359255","9783642359262"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35926-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}