{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:40Z","timestamp":1725664060812},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540562795"},{"type":"electronic","value":"9783540475019"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56279-6_89","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:58:44Z","timestamp":1330253924000},"page":"370-377","source":"Crossref","is-referenced-by-count":0,"title":["Recognizing an envelope of lines in linear time"],"prefix":"10.1007","author":[{"given":"Eric","family":"Gu\u00e9vremont","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jack","family":"Snoeyink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1090\/dimacs\/006\/03","volume-title":"Discrete and Computational Geometry: Papers from the DIMACS Special Year","author":"M. Bern","year":"1991","unstructured":"Marshall Bern, David Eppstein, Paul Plassmann, and Francis Yao. Horizon theorems for lines and polygons. In Jacob E. Goodman, Richard Pollack, and William Steiger, editors, Discrete and Computational Geometry: Papers from the DIMACS Special Year, pages 45\u201366. American Mathematical Society, Providence, RI, 1991."},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Bernard Chazelle. Triangulating a simple polygon in linear time. In Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, pages 220\u2013230, 1990.","DOI":"10.1109\/FSCS.1990.89541"},{"key":"38_CR3","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0031-3203(85)90050-0","volume":"18","author":"Y. T. Ching","year":"1985","unstructured":"Y. T. Ching and D. T. Lee. Finding the diameter of a set of lines. Pattern Recognition Letters, 18:249\u2013255, 1985.","journal-title":"Pattern Recognition Letters"},{"issue":"4","key":"38_CR4","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1137\/0218055","volume":"18","author":"R. Cole","year":"1989","unstructured":"R. Cole, J. Salowe, W. Steiger, E. Szemer\u00e9di An optimal-time algorithm for slope selection SIAM J. Comp. 18(4), pages 792\u2013810, 1989.","journal-title":"SIAM J. Comp."},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Herbert Edelsbrunner and Leonidas J. Guibas. Topologically sweeping an arrangement. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pages 389\u2013403, 1986.","DOI":"10.1145\/12130.12171"},{"key":"38_CR6","unstructured":"D. Eu, E. Gu\u00e9vremont, and G. T. Toussaint. On classes of arrangements of lines. Accepted to the Fourth Canadian Conference on Computational Geometry, 1992."},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","volume":"1","author":"R. Graham","year":"1972","unstructured":"R. Graham. An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters, 1:132\u2013133, 1972.","journal-title":"Information Processing Letters"},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/0196-6774(83)90013-5","volume":"4","author":"R. L. Graham","year":"1983","unstructured":"R. L. Graham and F. F. Yao. Finding the convex hull of a simple polygon. Journal of Algorithms, 4:324\u2013331, 1983.","journal-title":"Journal of Algorithms"},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Kurt Hoffmann, Kurt Mehlhorn, Pierre Rosenstiehl, and Robert E. Tarjan. Sorting Jordan sequences in linear time. In Proceedings of the ACM Symposium on Computational Geometry, pages 196\u2013203, 1985.","DOI":"10.1145\/323233.323259"},{"key":"38_CR10","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(91)90106-R","volume":"39","author":"M. Keil","year":"1991","unstructured":"M. Keil. A simple algorithm for determining the envelope of a set of lines. Information Processing Letters, 39:121\u2013124, 1991.","journal-title":"Information Processing Letters"},{"issue":"1","key":"38_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0031-3203(82)90057-7","volume":"15","author":"G. T. Toussaint","year":"1982","unstructured":"G. T. Toussaint and D. Avis. On a convex hull algorithm for polygons and its application to triangulation problems. Pattern Recognition, 15(1):23\u201329, 1982.","journal-title":"Pattern Recognition"},{"key":"38_CR12","unstructured":"G. Vegter. Computing the bounded region determined by finitely many lines in the plane. Technical Report 87-03, Rijksuniversiteit Groningen, 1987."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56279-6_89.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:03:03Z","timestamp":1605646983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56279-6_89"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540562795","9783540475019"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-56279-6_89","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}