{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T05:12:56Z","timestamp":1648876376187},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,8,1]],"date-time":"1995-08-01T00:00:00Z","timestamp":807235200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1995,8]]},"DOI":"10.1007\/bf01293668","type":"journal-article","created":{"date-parts":[[2005,3,24]],"date-time":"2005-03-24T22:06:22Z","timestamp":1111701982000},"page":"183-201","source":"Crossref","is-referenced-by-count":3,"title":["Finding a closest visible vertex pair between two polygons"],"prefix":"10.1007","volume":"14","author":[{"given":"N. M.","family":"Amato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","first-page":"800","volume":"II","author":"N. M. Amato","year":"1992","unstructured":"N. M. Amato. Computing the minimum visible vertex distance between two nonintersecting simple polygons.Proc. 1992 Conf. on Information Science and Systems, Vol. II, pp. 800?805, Princeton, NJ, 1992.","journal-title":"Proc. 1992 Conf. on Information Science and Systems"},{"key":"CR2","first-page":"400","volume-title":"Lecture Notes in Computer Science, Vol. 443","author":"D. P. Dobkin","year":"1990","unstructured":"D. P. Dobkin and D. G. Kirkpatrick. Determining the separation of preprocessed polyhedra-a unified approach.Proc. 17th Internat. Colloq. on Automata Language Programming, pp. 400?413. Lecture Notes in Computer Science, Vol. 443. Springer-Verlag, Berlin, 1990."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1016\/0898-1221(85)90109-9","volume":"11","author":"M. McKenna","year":"1985","unstructured":"M. McKenna and G. T. Toussaint. Finding the minimum vertex distance between two disjoint convex polygons in linear time.Comput. Math. Appl., 11:1227?1242, 1985.","journal-title":"Comput. Math. Appl."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF02243778","volume":"32","author":"G. T. Toussaint","year":"1984","unstructured":"G. T. Toussaint. An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons.Computing, 32:357?364, 1984.","journal-title":"Computing"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/BF01898356","volume":"1","author":"F. Chin","year":"1985","unstructured":"F. Chin, J. Sampson, and C. A. Wang. A unified approach for a class of problems in the computational geometry of polygons.Visual Comput., 1:124?132, 1985.","journal-title":"Visual Comput."},{"key":"CR6","volume-title":"M.Sc. thesis","author":"C. Wang","year":"1983","unstructured":"C. Wang. Intersection and Minimum Distance Problems for Planar Polgyons. M.Sc. thesis, Department of Computer Science, University of Alberta, Edmonton, Alberta, 1983."},{"key":"CR7","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. 2nd Ann. ACM Symp. on Computational Geometry, pp. 34?42, 1986.","DOI":"10.1145\/10515.10519"},{"key":"CR8","first-page":"115","volume-title":"Lecture Notes in Computer Science, Vol. 382","author":"A. Aggarwal","year":"1989","unstructured":"A. Aggarwal, S. Moran, P. W. Shor, and S. Suri. Computing the minimum visible vertex distance between two polygons.Proc. 1st Workshop on Algorithms and Data Structures, pp. 115?134. Lecture Notes in Computer Science, Vol. 382. Springer-Verlag, Berlin, 1989."},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"J. Hershberger and S. Suri. Matrix searching with the shortest path metric.Proc. 25th Ann. ACM Symp. on Theory of Computing (STOC 93), pp. 485?494, 1993.","DOI":"10.1145\/167088.167220"},{"issue":"2","key":"CR10","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1142\/S0218195992000093","volume":"2","author":"F. R. Hsu","year":"1992","unstructured":"F. R. Hsu, R. C. Chang, and R. C. T. Lee. Parallel algorithms for computing the closest visible vertex pair between two polygons.Internat. J. Comput. Geom. Appl., 2(2):135?162, 1992.","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"CR11","first-page":"869","volume-title":"Handbook of Theoretical Computer Science","author":"R. M. Karp","year":"1990","unstructured":"R. M. Karp and V. Ramachandran. Parallel algorithms for shared memory machines. In J. van Leeuwen, ed.,Handbook of Theoretical Computer Science, pp. 869?941. Elsevier\/MIT Press, Amsterdam\/Cambridge, MA, 1990."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1007\/BF01762130","volume":"3","author":"M. J. Atallah","year":"1988","unstructured":"M. J. Atallah and M. T. Goodrich. Parallel algorithms for some functions of two convex polygons.Algorithmica, 3:535?548, 1988.","journal-title":"Algorithmica"},{"key":"CR13","volume-title":"Ph.D. thesis","author":"S. Suri","year":"1987","unstructured":"S. Suri. Minimum Link Paths in Polygons and Related Problems. Ph.D. thesis, Department of Computer Science, Johns Hopkins University, Baltimore, MD, 1987."},{"issue":"4","key":"CR14","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1142\/S0218195994000240","volume":"4","author":"N. M. Amato","year":"1994","unstructured":"N. M. Amato. Determining the separation of simple polygons.Internat. J. Comput. Geom. Appl., 4(4):457?474, 1994.","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"D. G. Kirkpatrick. Efficient computation of continuous skeletons.Proc. 20th Ann. IEEE Symp. on Foundations of Computer Science, pp. 18?27, 1979.","DOI":"10.1109\/SFCS.1979.15"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S. J. Fortune","year":"1987","unstructured":"S. J. Fortune. A sweepline algorithm for Voronoi diagrams.Algorithmica, 2:153?174, 1987.","journal-title":"Algorithmica"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02187890","volume":"2","author":"C. K. Yap","year":"1987","unstructured":"C. K. Yap. An O(n logn) algorithm for the Voronoi diagram of a set of simple curve segments.Discrete Comput. Geom., 2:365?393, 1987.","journal-title":"Discrete Comput. Geom."},{"key":"CR18","volume-title":"Report 89-21","author":"N. Dadoun","year":"1987","unstructured":"N. Dadoun and D. Kirkpatrick. Optimal Parallel Algorithms for Convex Polygon Separation. Report 89-21, Department of Computer Science, University of British Columbia, Vancouver, British Columbia, 1987."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/BF01188708","volume":"9","author":"M. T. Goodrich","year":"1993","unstructured":"M. T. Goodrich, C. \u00d3'D\u00falaing, and C. Yap. Constructing the Voronoi diagram of a set of line segments in parallel.Algorithmica, 9:128?141, 1993.","journal-title":"Algorithmica"},{"key":"CR20","unstructured":"D. Z. Chen. Efficient geometric algorithms in the EREW-PRAM.Proc. 28th Allerton Conf. on Communications Control and Computing, pp. 818?827, 1990."},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"M. T. Goodrich, S. B. Shauck, and S. Guha. Parallel methods for visibility and shortest path problems in simple polygons.Proc. 6th Ann. A CM Symp. on Computational Geometry, pp. 73?82, 1990.","DOI":"10.1145\/98524.98539"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0196-6774(89)90032-1","volume":"10","author":"M. T. Goodrich","year":"1989","unstructured":"M. T. Goodrich. Triangulating a polygon in parallel.J. Algorithms, 10:327?351, 1989.","journal-title":"J. Algorithms"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/0022-0000(89)90041-X","volume":"39","author":"L. J. Guibas","year":"1989","unstructured":"L. J. Guibas and J. Hershberger. Optimal shortest path queries in a simple polygon.J. Comput. System Sci., 39:126?152, 1989.","journal-title":"J. Comput. System Sci."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B. Chazelle","year":"1991","unstructured":"B. Chazelle. Triangulating a simple polygon in linear time.Discrete Comput. Geom., 6:485?524, 1991.","journal-title":"Discrete Comput. Geom."},{"key":"CR25","doi-asserted-by":"crossref","unstructured":"M. J. Atallah and S. R. Kosaraju. An efficient parallel algorithm for the row minima of a totally monotone matrix.Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms, pp. 394?403, 1991.","DOI":"10.1016\/0196-6774(92)90046-F"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1016\/0743-7315(86)90011-0","volume":"3","author":"M. J. Atallah","year":"1986","unstructured":"M. J. Atallah and M. T. Goodrich. Efficient parallel solutions to some geometric problems.J. Parallel Distrib. Comput., 3:492?507, 1986.","journal-title":"J. Parallel Distrib. Comput."},{"key":"CR27","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01762120","volume":"3","author":"A. Aggarwal","year":"1988","unstructured":"A. Aggarwal, B. Chazelle, L. Guibas, C. \u00d3'D\u00fanlaing, and C. Yap. Parallel computational geometry.Algorithmica, 3:293?327, 1988.","journal-title":"Algorithmica"},{"issue":"12","key":"CR28","doi-asserted-by":"crossref","first-page":"1605","DOI":"10.1109\/12.9737","volume":"37","author":"R. Miller","year":"1988","unstructured":"R. Miller and Q. F. Stout. Efficient parallel convex hull algorithms.IEEE Trans. Comput., 37(12):1605?1618, 1988.","journal-title":"IEEE Trans. Comput."},{"key":"CR29","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1109\/TIT.1984.1056845","volume":"30","author":"B. K. Bhattacharya","year":"1984","unstructured":"B. K. Bhattacharya and H. ElGindy. A new linear convex hull algorithm for simple polygons.IEEE Trans. Inform. Theory, 30:85?88, 1984.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"CR30","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(78)90062-5","volume":"7","author":"M. R. Garey","year":"1978","unstructured":"M. R. Garey, D. S. Johnson, F. P. Preparata, and R. E. Tarjan. Triangulating a simple polygon.Inform. Process. Lett., 7:175?179, 1978.","journal-title":"Inform. Process. Lett."},{"key":"CR31","doi-asserted-by":"crossref","unstructured":"A. Aggarwal, M. M. Klawe, S. Moran, P. Shor, and R. Wilber. Geometric applications of a matrix searching algorithm.Proc. 2nd Ann. ACM Symp. on Computational Geometry, pp. 285?292, 1986.","DOI":"10.1145\/10515.10546"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01293668.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01293668\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01293668","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T13:35:53Z","timestamp":1586180153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01293668"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,8]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,8]]}},"alternative-id":["BF01293668"],"URL":"https:\/\/doi.org\/10.1007\/bf01293668","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,8]]}}}