{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:16Z","timestamp":1725663796861},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_235","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:07:33Z","timestamp":1330258053000},"page":"48-59","source":"Crossref","is-referenced-by-count":1,"title":["An optimal algorithm for finding the separation of simple polygons"],"prefix":"10.1007","author":[{"given":"Nancy M.","family":"Amato","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"issue":"2","key":"7_CR1","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, R. Wilber, Geometric Applications of a Matrix Searching Algorithm, Algorithmica 2(2) (1986), pp. 195\u2013208.","journal-title":"Algorithmica"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science 382","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/3-540-51542-9_11","volume-title":"Proc. of WADS 1989","author":"A. Aggarwal","year":"1989","unstructured":"A. Aggarwal, S. Moran, P. Shor, S. Suri, Computing the Minimum Visible Vertex Distance Between Two Polygons, Proc. of WADS 1989, and Lecture Notes in Computer Science 382, Eds. F. Dehne, J. R. Sack, N. Santoro, Springer Verlag, Berlin, (1989), pp. 115\u2013134."},{"key":"7_CR3","unstructured":"N. Amato, Computing the Minimum Visible Vertex Distance Between Two Nonintersecting Simple Polygons, Proceedings of the 1992 Conference on Information Sciences and Systems Vol. II, Princeton, NJ, (1992), pp. 800\u2013805. (Also, Coordinated Science Laboratory Tech. Report, No. UILU-ENG-92-2206 (ACT 120), University of Illinois at Urbana-Champaign.)"},{"key":"7_CR4","volume-title":"Coordinated Science Laboratory Tech. Report, No. UILUENG-92-2248 (ACT 125)","author":"N. Amato","year":"1992","unstructured":"N. Amato, An Optimal Algorithm for Determining the Separation of Two Nonintersecting Simple Polygons, Coordinated Science Laboratory Tech. Report, No. UILUENG-92-2248 (ACT 125), University of Illinois at Urbana-Champaign, (1992)."},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/BF01762130","volume":"3","author":"M. Atallah","year":"1988","unstructured":"M. Atallah and M. Goodrich, Parallel Algorithms for Some Functions of Two Convex Polygons, Algorithmica 3 (1988), pp. 535\u2013548.","journal-title":"Algorithmica"},{"key":"7_CR6","first-page":"571","volume":"c29","author":"B. Bhattacharya","year":"1984","unstructured":"B. Bhattacharya and H. El Gindy, A New Linear Convex Hull Algorithm for Simple Polygon, IEEE Inform. Theory c29 (1984), pp. 571\u2013573.","journal-title":"IEEE Inform. Theory"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"B. Chazelle, Triangulating a Simple Polygon in Linear Time, Proc. of 31st Annual Symposium on Foundations of Computer Science (1990), pp. 220\u2013230.","DOI":"10.1109\/FSCS.1990.89541"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/7531.24036","volume":"34","author":"B. Chazelle","year":"1987","unstructured":"B. Chazelle and D. Dobkin, Intersection of Convex Objects in Two and Three Dimensions, Journal of the ACM 34 (1987), pp. 1\u201327.","journal-title":"Journal of the ACM"},{"key":"7_CR9","first-page":"1205","volume":"c32","author":"F. Chin","year":"1983","unstructured":"F. Chin and C. Wang, Optimal Algorithms for the Intersection and the Minimum Distance Problems between Planar Polygons, IEEE Trans. on Computers c32 (1983), pp. 1205\u20131207.","journal-title":"IEEE Trans. on Computers"},{"issue":"2","key":"7_CR10","first-page":"124","volume":"1","author":"F. Chin","year":"1985","unstructured":"F. Chin, C. Wang, J. Sampson, An Unifying Approach for a Class of Computational Geometry Problem, The Visual Computer \u2014 Internat. Journal of Computer Graphics 1(2) (1985), pp. 124\u2013133.","journal-title":"The Visual Computer \u2014 Internat. Journal of Computer Graphics"},{"key":"7_CR11","volume-title":"Technical Report #89-21","author":"N. Dadoun","year":"1989","unstructured":"N. Dadoun and D. Kirkpatrick, Optimal Parallel Algorithms for Convex Polygon Separation, Technical Report #89-21, Department of Computer Science, University of British Columbia, Vancouver BC, Canada (1989)."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"D. Dobkin and D. Kirkpatrick, Determining the Separation of Preprocessed Polyhedra \u2014 A Unified Approach, ICALP (1990), pp. 400\u2013413.","DOI":"10.1007\/BFb0032047"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0196-6774(85)90039-2","volume":"6","author":"H. Edelsbrunner","year":"1985","unstructured":"H. Edelsbrunner, On Computing the Extreme Distance Between Two Convex Polygons, Journal of Algorithms 6 (1985), pp. 213\u2013224.","journal-title":"Journal of Algorithms"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"M. Goodrich, C. \u00d3'D\u00fanlaing, and C. Yap, Computing the Voronoi Diagram of a Set of Line Segments in Parallel, Lecture Notes 382: WADS '89, Springer-Verlag (1989).","DOI":"10.1007\/3-540-51542-9_3"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"D. Kirkpatrick, Efficient Computation of Continuous Skeletons, Proc. of the 20th Annual Symposium on the Foundations of Computer Science (1979), pp. 18\u201327.","DOI":"10.1109\/SFCS.1979.15"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"D. Mount, Intersection Detection and Separators for Simple Polygons, Proc. of the Eighth ACM Annual Symposium on Computational Geometry (1992), pp. 303\u2013311.","DOI":"10.1145\/142675.142737"},{"key":"7_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F. Preparata","year":"1985","unstructured":"F. Preparata and M. Shamos, Computational Geometry, Springer-Verlag, New York (1985)."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"C. A. Wang and E. P. F. Chan, Finding the Minimum Visible Vertex Distance Between Two Nonintersecting Simple Polygons, Proc. of the Second ACM Annual Symposium on Computational Geometry (1986), pp. 34\u201342.","DOI":"10.1145\/10515.10519"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_235.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:12Z","timestamp":1605647292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_235"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_235","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}