{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:50:21Z","timestamp":1725529821816},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540922940"},{"type":"electronic","value":"9783540922957"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92295-7_14","type":"book-chapter","created":{"date-parts":[[2009,3,25]],"date-time":"2009-03-25T08:00:00Z","timestamp":1237968000000},"page":"91-98","source":"Crossref","is-referenced-by-count":2,"title":["A Cost-Optimal Algorithm for Guard Zone Problem"],"prefix":"10.1007","author":[{"given":"Ranjan","family":"Mehera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajat K.","family":"Pal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03427-9","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"1997","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Berlin (1997)"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B. Chazelle","year":"1991","unstructured":"Chazelle, B.: Triangulating a Simple Polygon in Linear Time. Discrete Computational Geometry\u00a06, 485\u2013524 (1991)","journal-title":"Discrete Computational Geometry"},{"issue":"2","key":"14_CR3","first-page":"218","volume":"80","author":"A. Hernandez-Barrera","year":"1996","unstructured":"Hernandez-Barrera, A.: Computing the Minkowski Sum of Monotone Polygons. IEICE Trans. on Information Systems\u00a0 E80-D(2), 218\u2013222 (1996)","journal-title":"IEICE Trans. on Information Systems"},{"key":"14_CR4","volume-title":"Advanced Computer Architecture: Parallelism, Scalability, Programmability","author":"K. Hwang","year":"1993","unstructured":"Hwang, K.: Advanced Computer Architecture: Parallelism, Scalability, Programmability. McGraw Hill, New York (1993)"},{"key":"14_CR5","volume-title":"Computer Architecture and Parallel Processing","author":"K. Hwang","year":"1984","unstructured":"Hwang, K., Briggs, F.A.: Computer Architecture and Parallel Processing. McGraw-Hill, New York (1984)"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1006\/jagm.2000.1092","volume":"37","author":"S.C. Nandy","year":"2000","unstructured":"Nandy, S.C., Bhattacharya, B.B., Hernandez-Barrera, A.: Safety Zone Problem. Journal of Algorithms\u00a037, 538\u2013569 (2000)","journal-title":"Journal of Algorithms"},{"key":"14_CR7","volume-title":"Computer Architecture: A Quantitative Approach","author":"D.A. Patterson","year":"1996","unstructured":"Patterson, D.A., Hennesy, J.L.: Computer Architecture: A Quantitative Approach, 2nd edn. Morgan Kaufman, San Francisco (1996)","edition":"2"},{"key":"14_CR8","volume-title":"Computational Line Geometry","author":"H. Pottmann","year":"1997","unstructured":"Pottmann, H., Wallner, J.: Computational Line Geometry. Springer, Berlin (1997)"},{"key":"14_CR9","volume-title":"Parallel Computing: Theory and Practice","author":"M.J. Quinn","year":"1994","unstructured":"Quinn, M.J.: Parallel Computing: Theory and Practice, 2nd edn. McGraw-Hill, New York (1994)","edition":"2"},{"key":"14_CR10","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1145\/237218.237374","volume-title":"Proc. of the 12th Annual ACM Symposium on Computational Geometry","author":"G.D. Ramkumar","year":"1996","unstructured":"Ramkumar, G.D.: An Algorithm to Compute the Minkowski Sum Outer Face of Two Simple Polygons. In: Proc. of the 12th Annual ACM Symposium on Computational Geometry, pp. 234\u2013241. Association for Computing Machinery, New York (1996)"},{"key":"14_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2219-2","volume-title":"Algorithms for VLSI Physical Design Automation","author":"N.A. Sherwani","year":"1993","unstructured":"Sherwani, N.A.: Algorithms for VLSI Physical Design Automation. Kluwer Academic, Boston (1993)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92295-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T16:02:43Z","timestamp":1684944163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92295-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540922940","9783540922957"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92295-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}