{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:23:50Z","timestamp":1760441030770},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602200"},{"type":"electronic","value":"9783540447474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60220-8_61","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:52:21Z","timestamp":1330278741000},"page":"183-193","source":"Crossref","is-referenced-by-count":6,"title":["Computing common tangents without a separating line"],"prefix":"10.1007","author":[{"given":"David","family":"Kirkpatrick","sequence":"first","affiliation":[]},{"given":"Jack","family":"Snoeyink","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"16_CR1","unstructured":"Pankaj K. Agarwal. Intersection and decomposition algorithms for planar arrangements. Cambridge University Press, 1991."},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/BF02187747","volume":"4","author":"B. Chazelle","year":"1989","unstructured":"Bernard Chazelle and Leonidas J. Guibas. Visibility and intersection problems in plane geometry. Discrete & Computational Geometry, 4:551\u2013581, 1989.","journal-title":"Discrete & Computational Geometry"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"David P. Dobkin and David G. Kirkpatrick. Determining the separation of preprocessed polyhedra: A unified approach. In Seventeenth International Colloquium on Automata, Languages and Programming, number 443 in Lecture Notes in Computer Science, pages 400\u2013413. Springer-Verlag, 1990.","DOI":"10.1007\/BFb0032047"},{"key":"16_CR4","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. Computing the extreme distances between two convex polygons. Journal of Algorithms, 6:213\u2013224, 1985.","journal-title":"Journal of Algorithms"},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/BF02187742","volume":"4","author":"H. Edelsbrunner","year":"1989","unstructured":"Herbert Edelsbrunner, Leonidas Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, and Emo Welzl. Implicitly representing arrangements of lines or segments. Discrete & Computational Geometry, 4:433\u2013466, 1989.","journal-title":"Discrete & Computational Geometry"},{"key":"16_CR6","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0020-0190(87)90207-9","volume":"25","author":"D. Gries","year":"1987","unstructured":"D. Gries and I. Stojmenovi\u0107. A note on Graham's convex hull algorithm. Information Processing Letters, 25:323\u2013327, 1987.","journal-title":"Information Processing Letters"},{"issue":"1","key":"16_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0218195991000025","volume":"1","author":"L. Guibas","year":"1991","unstructured":"Leo Guibas, John Hershberger, and Jack Snoeyink. Compact interval trees: A data structure for convex hulls. International Journal of Computational Geometry & Applications, 1(1):1\u201322, 1991.","journal-title":"International Journal of Computational Geometry & Applications"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"David Kirkpatrick and Jack Snoeyink. Tentative prune-and-search for computing Voronoi vertices. In Proceedings of the Ninth Annual ACM Symposium on Computational Geometry, pages 133\u2013142, 1993.","DOI":"10.1145\/160985.161009"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","volume":"23","author":"M. Overmars","year":"1981","unstructured":"M. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. Journal of Computer and System Sciences, 23:166\u2013204, 1981.","journal-title":"Journal of Computer and System Sciences"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Jorge Stolfi. Oriented projective geometry: A framework for geometric computations. Academic Press, 1991.","DOI":"10.1016\/B978-0-12-672025-9.50005-8"}],"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-60220-8_61.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:56:09Z","timestamp":1605646569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60220-8_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602200","9783540447474"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-60220-8_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}