{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T20:31:24Z","timestamp":1719174684141},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1985,8,1]],"date-time":"1985-08-01T00:00:00Z","timestamp":491702400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Visual Computer"],"published-print":{"date-parts":[[1985,8]]},"DOI":"10.1007\/bf01898356","type":"journal-article","created":{"date-parts":[[2005,7,5]],"date-time":"2005-07-05T10:39:48Z","timestamp":1120559988000},"page":"124-132","source":"Crossref","is-referenced-by-count":3,"title":["A unifying approach for a class of problems in the computational geometry of polygons"],"prefix":"10.1007","volume":"1","author":[{"given":"Francis","family":"Chin","sequence":"first","affiliation":[]},{"given":"Jeffrey","family":"Sampson","sequence":"additional","affiliation":[]},{"given":"Cao An","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01898356_CR1","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"28","author":"J Bentley","year":"1979","unstructured":"Bentley J, Ottmann T (1979) Algorithms for reporting and counting geometric intersections. IEEE Transactions on Computers c-28:643\u2013647","journal-title":"IEEE Transactions on Computers c"},{"key":"BF01898356_CR2","unstructured":"Chazelle B, Dobkin D (1980) Detection is easier than computation. ACM Symposium on the Theory of Computing, pp 146\u2013153"},{"key":"BF01898356_CR3","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/TC.1983.1676186","volume":"32","author":"F Chin","year":"1983","unstructured":"Chin F, Wang C (1983) Optimal algorithms for the intersection and the minimum distance problems between planar polygons. IEEE Transactions on Computers c-32:1203\u20131207","journal-title":"IEEE Transactions on Computers c"},{"key":"BF01898356_CR4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0020-0190(84)90073-5","volume":"17","author":"F Chin","year":"1984","unstructured":"Chin F, Wang C (1984) Minimum vertex distance between two separable convex polygons. Information Processing Letters 17:41\u201345","journal-title":"Information Processing Letters"},{"key":"BF01898356_CR5","volume-title":"On computing the extreme distances between two convex polygons","author":"H Edelsbrunner","year":"1982","unstructured":"Edelsbrunner H (1982) On computing the extreme distances between two convex polygons. IIG, Technische Universit\u00e4t Graz, Austria, Report 96"},{"key":"BF01898356_CR6","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(78)90062-5","volume":"7","author":"M Garey","year":"1978","unstructured":"Garey M, Johnson D, Preparata F, Tarjan R (1978) Triangulating a simple polygon. Information Processing Letters 7:175\u2013179","journal-title":"Information Processing Letters"},{"key":"BF01898356_CR7","doi-asserted-by":"crossref","unstructured":"Kirkpatrick D (1979) Efficient computation of continuous skeletons. Proceedings of the 20th Annual Symposium on the Foundations of Computer Science, pp 18\u201327","DOI":"10.1109\/SFCS.1979.15"},{"key":"BF01898356_CR8","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1137\/0210006","volume":"10","author":"D Lee","year":"1981","unstructured":"Lee D (1981) Generalization of Voronoi diagrams in the plane. SIAM J Comput 10:73\u201387","journal-title":"SIAM J Comput"},{"key":"BF01898356_CR9","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1145\/358656.358681","volume":"25","author":"J Nievergelt","year":"1982","unstructured":"Nievergelt J, Preparata F (1982) Plane-sweep algorithms for intersecting geometric figures. Communications of the ACM 25:739\u2013747","journal-title":"Communications of the ACM"},{"key":"BF01898356_CR10","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/0020-0190(81)90051-X","volume":"13","author":"J Schwartz","year":"1981","unstructured":"Schwartz J (1981) Finding the minimum distance between two convex polygons. Information Processing Letters 13:168\u2013170","journal-title":"Information Processing Letters"},{"key":"BF01898356_CR11","doi-asserted-by":"crossref","unstructured":"Shamos M (1975) Geometric complexity. Proceedings of the 17th Annual ACM Symposium on the Theory of Computing, pp 224\u2013233","DOI":"10.1145\/800116.803772"},{"key":"BF01898356_CR12","doi-asserted-by":"crossref","unstructured":"Shamos M, Hoey D (1976) Geometric intersection problems. Proceedings of the 17th Annual Conference on the Foundations of Computer Science, pp 208\u2013215","DOI":"10.1109\/SFCS.1976.16"},{"key":"BF01898356_CR13","unstructured":"Toussaint G (1982) Complexity, convexity, and unimodality. Proceedings of the Second World Conference on Mathematics"},{"key":"BF01898356_CR14","unstructured":"Toussaint G (1983) An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons. 21st Allerton Conference on Communication, Control, and Computing, pp 457\u2013458"},{"key":"BF01898356_CR15","unstructured":"Wang C (1983) Intersection and minimum distance problems for planar polygons. M.Sc. Thesis, Department of Computing Science, University of Alberta"}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01898356.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01898356\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01898356","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T11:47:24Z","timestamp":1557488844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01898356"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,8]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,8]]}},"alternative-id":["BF01898356"],"URL":"https:\/\/doi.org\/10.1007\/bf01898356","relation":{},"ISSN":["0178-2789","1432-2315"],"issn-type":[{"value":"0178-2789","type":"print"},{"value":"1432-2315","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,8]]}}}