{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T23:15:09Z","timestamp":1701126909031},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1982,9,1]],"date-time":"1982-09-01T00:00:00Z","timestamp":399686400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1982,9]]},"DOI":"10.1007\/bf01934440","type":"journal-article","created":{"date-parts":[[2005,7,30]],"date-time":"2005-07-30T16:54:02Z","timestamp":1122742442000},"page":"274-281","source":"Crossref","is-referenced-by-count":71,"title":["Stabbing line segments"],"prefix":"10.1007","volume":"22","author":[{"given":"H.","family":"Edelsbrunner","sequence":"first","affiliation":[]},{"given":"H. A.","family":"Maurer","sequence":"additional","affiliation":[]},{"given":"F. P.","family":"Preparata","sequence":"additional","affiliation":[]},{"given":"A. L.","family":"Rosenberg","sequence":"additional","affiliation":[]},{"given":"E.","family":"Welzl","sequence":"additional","affiliation":[]},{"given":"D.","family":"Wood","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01934440_CR1","unstructured":"K. Q. Brown,Geometric transforms for fast geometric algorithms, Report CMU-CS-80-101, Department of Computer Science, Carnegie-Mellon University (1980)."},{"key":"BF01934440_CR2","unstructured":"H. Edelsbrunner, D. G. Kirkpatrick and H. A. Maurer,Polygonal intersection searching, Report F64, Institut f\u00fcr Informationsverarbeitung, Technical University of Graz (1981)."},{"key":"BF01934440_CR3","unstructured":"H. Edelsbrunner, M. H. Overmars and D. Wood,Graphics in flatland: A case study, Report F79, Institut f\u00fcr Informationsverarbeitung, Technical University of Graz (1981)."},{"key":"BF01934440_CR4","doi-asserted-by":"crossref","unstructured":"M. L. Fredman,The inherent complexity of dynamic data structures which accommodate range queries, Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science (1980), 191\u2013199.","DOI":"10.1109\/SFCS.1980.47"},{"key":"BF01934440_CR5","unstructured":"I. G. Gowda and D. G. Kirkpatrick,Exploiting linear merging and extra storage in the maintenance of fully dynamic geometric data structures, Proceedings of the 18th Annual Allerton Conference on Communication, Control, and Computing (1980), 1\u201310."},{"key":"BF01934440_CR6","unstructured":"D. T. Lee,Proximity and reachability in the plane, Report R-831, Coordinated Science Laboratory, University of Illinois (1978)."},{"key":"BF01934440_CR7","unstructured":"D. T. Lee and F. P. Preparata,Finding shortest paths with parallel segments as obstacles, In preparation."},{"key":"BF01934440_CR8","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0196-6774(81)90025-0","volume":"2","author":"M. H. Overmars","year":"1981","unstructured":"M. H. Overmars,Dynamization of order decomposable set problems, Journal of Algorithms 2 (1981), 245\u2013260.","journal-title":"Journal of Algorithms"},{"key":"BF01934440_CR9","doi-asserted-by":"crossref","unstructured":"M. I. Shamos and D. Hoey,Geometric intersection problems, Proceedings of the 17th Annual IEEE Symposium on Foundations of Computer Science (1976), 208\u2013215.","DOI":"10.1109\/SFCS.1976.16"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01934440.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01934440\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01934440","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T01:10:01Z","timestamp":1557450601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01934440"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,9]]}},"alternative-id":["BF01934440"],"URL":"https:\/\/doi.org\/10.1007\/bf01934440","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,9]]}}}