{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:48Z","timestamp":1725663288496},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540515425"},{"type":"electronic","value":"9783540482376"}],"license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"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":[[1989]]},"DOI":"10.1007\/3-540-51542-9_11","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:06:12Z","timestamp":1330203972000},"page":"115-134","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Computing the minimum visible vertex distance between two polygons"],"prefix":"10.1007","author":[{"given":"Alok","family":"Aggarwal","sequence":"first","affiliation":[]},{"given":"Shlomo","family":"Moran","sequence":"additional","affiliation":[]},{"given":"Peter W.","family":"Shor","sequence":"additional","affiliation":[]},{"given":"Subhash","family":"Suri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"11_CR1","unstructured":"A. Aggarwal and S. Suri, \"An Efficient Algorithm for Computing the Farthest Visible pair in a Simple Polygon,\" Manuscript in preparation, 1989."},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF01840359","volume":"2","author":"A. Aggarwal","year":"1986","unstructured":"A. Aggarwal, M. Klawe, S. Moran, P. W. Shor, and R. Wilber, \"Geomteric Applications of a Matrix Searching Algorithm,\" Algorithmica, Vol. 2, No. 2, pp. 195\u2013208, 1986.","journal-title":"Algorithmica"},{"key":"11_CR3","first-page":"571","volume":"C-29","author":"B. Bhattacharya","year":"1984","unstructured":"B. Bhattacharya and H. El Gindy, \"A New Linear Convex Hull Algorithm for Simple Polygon,\" IEEE Trans. on Information Theory, Vol. C-29, pp. 571\u2013573, 1984.","journal-title":"IEEE Trans. on Information Theory"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"B. M. Chazelle, \"A Theorem for Polygon Cutting with Applications,\" Proc. of the 23rd IEEE Annual Symposium on the Foundations of Computer Science, pp. 339\u2013349, 1983.","DOI":"10.1109\/SFCS.1982.58"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"B. M. Chazelle and L. J. Guibas, \"Visibility and intersection Problems in Plane Geometry,\" Proc. of the First ACM Annual Symposium on Computational Geometry, pp. 135\u2013146, 1985.","DOI":"10.1145\/323233.323252"},{"key":"11_CR6","unstructured":"B. M. Chazelle and M. Sharir, \"An Algorithm for Generalized Point Location and Its Applications,\" Tech. Report, Computer Science Department, Courant Institute of Math. Sciences, New York University, June 1988."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"L. J. Guibas and J. Hershberger, \"Optimal Shortest Path Queries in a Simple Polygon,\" Proc. of the Third ACM Annual Symposium on Computational Geometry, pp. 50\u201363, 1987.","DOI":"10.1145\/41958.41964"},{"issue":"2","key":"11_CR8","first-page":"209","volume":"2","author":"L. J. Guibas","year":"1987","unstructured":"L. J. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. E. Tarjan, \"Linear Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons,\" Vol. 2, No. 2, pp. 209\u2013234, 1987.","journal-title":"Linear Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons"},{"issue":"4","key":"11_CR9","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/0196-6774(83)90013-5","volume":"4","author":"R. L. Graham","year":"1983","unstructured":"R. L. Graham and F. F. Yao, \"Finding the Convex Hull of a Simple Polygon,\" Stanford Univ., Stanford, CA, Tech. Report STAN-CS-81-887. Also appears in J. of Algorithms, Vol. 4, No. 4, pp. 324\u2013331, 1983.","journal-title":"J. of Algorithms"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"D. T. Lee and A. K. Lin, \"Generalized Delaunay Triangulations for Planar Graphs,\" Discrete and Computational Geometry, pp. 201\u2013216, 1986.","DOI":"10.1007\/BF02187695"},{"key":"11_CR11","first-page":"178","volume":"9","author":"D. McCullem","year":"1979","unstructured":"D. McCullem and D. Avis, \"A Linear Algorithm for Finding the Convex Hull of a Simple Polygon,\" Info. Proc. Letters, Vol. 9, pp. 178\u2013181, 1979.","journal-title":"Info. Proc. Letters"},{"key":"11_CR12","unstructured":"M. McKenna and J. O'Rourke, Public Communication, 1987."},{"key":"11_CR13","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos, Computational Geometry, Springer Verlag, New York, pp. 110\u2013112, 1985."},{"key":"11_CR14","volume-title":"Minimum Link Paths in Polygons and Related Problems","author":"S. Suri","year":"1987","unstructured":"S. Suri, \"Minimum Link Paths in Polygons and Related Problems,\" Ph. D. Thesis, Dept. of Computer Science, The Johns Hopkins University, Baltimore, Maryland, 1987."},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"S. Suri, \"The All-Geodesic Farthest Neighbors Problem for Simple Polygons,\" Proc. of the Third ACM Annual Symposium on Computational geometry, pp. 64\u201375, 1987. To appear in the Journal of Computer Systems and Sciences, 1989.","DOI":"10.1145\/41958.41965"},{"key":"11_CR16","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1137\/0217010","volume":"17","author":"R. E. Tarjan","year":"1988","unstructured":"R. E. Tarjan and C. Van Wyk, \"An O(n log log n) Algorithm for Triangulating a Simple Polygon,\" SIAM J. on Computing, Vol. 17, pp. 143\u2013178, 1988.","journal-title":"SIAM J. on Computing"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"C. A. Wang and E. P. F. Chan, \"Finding the Minimum Visible Vertex Distance Between Two Nonintersecting Polygons,\" Proc. of the Second ACM Annual Symposium on Computational Geometry, pp. 34\u201342, 1986.","DOI":"10.1145\/10515.10519"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51542-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:33:40Z","timestamp":1578526420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51542-9_11"}},"subtitle":["Preliminar version"],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515425","9783540482376"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-51542-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]},"assertion":[{"value":"26 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}