{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T18:16:58Z","timestamp":1771870618232,"version":"3.50.1"},"reference-count":13,"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\/bf01898355","type":"journal-article","created":{"date-parts":[[2005,7,5]],"date-time":"2005-07-05T14:39:48Z","timestamp":1120574388000},"page":"118-123","source":"Crossref","is-referenced-by-count":38,"title":["A simple linear algorithm for intersecting convex polygons"],"prefix":"10.1007","volume":"1","author":[{"given":"Godfried T.","family":"Toussaint","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01898355_CR1","unstructured":"Chazelle B (1980) Computational geometry and convexity. Ph.D. thesis, Carnegie-Mellon University"},{"key":"BF01898355_CR2","doi-asserted-by":"crossref","unstructured":"Chazelle B, Dobkin D (1980) Detection is easier than computation.Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing. pp 146\u2013153","DOI":"10.1145\/800141.804662"},{"key":"BF01898355_CR3","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(78)90062-5","volume":"7","author":"MR Garey","year":"1978","unstructured":"Garey MR, Johnson DS, Preparata FP, Tarjan RE (1978) Triangulating a simple polygon.Information Processing Lett 7:175\u2013179","journal-title":"Information Processing Lett"},{"key":"BF01898355_CR4","doi-asserted-by":"crossref","unstructured":"Guibas L, Ramshaw L, Stolfi J (1983) A kinetic framework for computational geometry. Technical report. Xerox Park and Stanford University","DOI":"10.1109\/SFCS.1983.1"},{"key":"BF01898355_CR5","doi-asserted-by":"crossref","unstructured":"Meisters GH (1975) Polygons have ears.American Mathematical Monthly. June\/July 1975, 648\u2013651","DOI":"10.1080\/00029890.1975.11993898"},{"key":"BF01898355_CR6","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/0146-664X(82)90023-5","volume":"19","author":"J O'Rourke","year":"1982","unstructured":"O'Rourke J (1982) A new linear algorithm for intersecting convex polygons.Comput Graph Image Processing 19:384\u2013391","journal-title":"Comput Graph Image Processing"},{"key":"BF01898355_CR7","unstructured":"Shamos MI (1978) Computational Geometry, Ph.D. thesis, Yale University"},{"key":"BF01898355_CR8","unstructured":"Shamos MI (1977)Problems in Computational Geometry. Carnegie-Mellon University"},{"key":"BF01898355_CR9","unstructured":"Shamos MI, Hoey D (1976) Geometric intersection problemsProc. Seventeenth Annual IEEE Symposium on Foundations of Computer Science. October 1976, pp 208\u2013215"},{"key":"BF01898355_CR10","unstructured":"Toussaint GT (1981) Computational geometric problems in pattern recognition. In: Kittler J (ed)Pattern Recognition Theory and Applications. p 73\u201391"},{"key":"BF01898355_CR11","unstructured":"Toussaint GT (1983) Solving geometric problems with the \u2018rotating calipers\u2019.Proc. MELECON, Athens. Greece"},{"key":"BF01898355_CR12","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF02243778","volume":"32","author":"GT Toussaint","year":"1984","unstructured":"Toussaint GT (1984) An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons.Computing 32:357\u2013364","journal-title":"Computing"},{"key":"BF01898355_CR13","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0031-3203(82)90057-7","volume":"15","author":"GT Toussaint","year":"1982","unstructured":"Toussaint GT, Avis D (1982) On a convex hull algorithm for polygons and its application to triangulation problems.Pattern Recognition 15:23\u201329","journal-title":"Pattern Recognition"}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01898355.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01898355\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01898355","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T04:32:37Z","timestamp":1586320357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01898355"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,8]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,8]]}},"alternative-id":["BF01898355"],"URL":"https:\/\/doi.org\/10.1007\/bf01898355","relation":{},"ISSN":["0178-2789","1432-2315"],"issn-type":[{"value":"0178-2789","type":"print"},{"value":"1432-2315","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,8]]}}}