{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T03:35:43Z","timestamp":1648697743006},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1984,2,1]],"date-time":"1984-02-01T00:00:00Z","timestamp":444441600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer and Information Sciences"],"published-print":{"date-parts":[[1984,2]]},"DOI":"10.1007\/bf00989481","type":"journal-article","created":{"date-parts":[[2005,3,24]],"date-time":"2005-03-24T20:32:14Z","timestamp":1111696334000},"page":"23-32","source":"Crossref","is-referenced-by-count":4,"title":["An optimal time and minimal space algorithm for rectangle intersection problems"],"prefix":"10.1007","volume":"13","author":[{"given":"D. T.","family":"Lee","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"M. I. Shamos, and D. Hoey, Geometric intersection problems,Proc. 17th IEEE Symp. Foundations of Computer Science, pp. 208?215 (October 1976).","DOI":"10.1109\/SFCS.1976.16"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"C28","author":"J. L. Bentley","year":"1979","unstructured":"J. L. Bentley and T. Ottmann, Algorithms for reporting and counting geometric intersections,IEEE Trans. Comput.,C28: 643?647 (September 1979).","journal-title":"IEEE Trans. Comput."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/TC.1981.6312179","volume":"C30","author":"K. Q. Brown","year":"1981","unstructured":"K. Q. Brown, Comments on ?Algorithms for reporting and counting geometric intersections?,IEEE Trans. Comput.,C30: 147?148 (February 1981).","journal-title":"IEEE Trans. Comput."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1109\/TC.1980.1675628","volume":"C29","author":"J. L. Bentley","year":"1980","unstructured":"J. L. Bentley and D. Wood, An optimal worst-case algorithm for reporting intersections of rectangles,IEEE Trans. Comput.,C29: 571?576 (July 1980).","journal-title":"IEEE Trans. Comput."},{"key":"CR5","unstructured":"J. L. Bentley, Algorithms for Klee's rectangle problem, (unpublished manuscript) Carnegie-Mellon University, 1977."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/BF01933636","volume":"20","author":"H. W. Six","year":"1980","unstructured":"H. W. Six and D. Wood, The rectangle intersection problem revisited,BIT,20: 426?433, 1980.","journal-title":"BIT"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/0146-664X(80)90034-9","volume":"13","author":"V. Vaishnavi","year":"1980","unstructured":"V. Vaishnavi and D. Wood, Data structures for the rectangle containment and enclosure problems,Computer Graphics and Image Processing, 13: 372?384, 1980.","journal-title":"Computer Graphics and Image Processing"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0196-6774(81)90033-X","volume":"2","author":"D. T. Lee","year":"1981","unstructured":"D. T. Lee and C. K. Wong, Finding intersection of rectangles by range search,J. Algorithms,2: 337?347, 1981.","journal-title":"J. Algorithms"},{"key":"CR9","unstructured":"H. Edelsbrunner, Dynamic rectangle intersection searching, Inst. for Informationsverarbeitung, TU Graz, Bericht 47 (February 1980)."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0020-0190(79)90117-0","volume":"8","author":"J. L. Bentley","year":"1979","unstructured":"J. L. Bentley, Decomposable searching problems,Info. Proc. Lett.,8: 244?251, 1979.","journal-title":"Info. Proc. Lett."},{"issue":"5","key":"CR11","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0020-0190(82)90119-3","volume":"15","author":"G. S. Lueker","year":"1982","unstructured":"G. S. Lueker and D. E. Willard, A data structure for dynamic range queries,Info. Proc. Lett, 15(5): 209?213 (December 1982).","journal-title":"Info. Proc. Lett"},{"issue":"3","key":"CR12","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0196-6774(82)90021-9","volume":"3","author":"D. T. Lee","year":"1982","unstructured":"D. T. Lee and F. P. Preparata, An improved algorithm for the rectangle enclosure problem,J. Algorithms,3(3): 218?224, 1982.","journal-title":"J. Algorithms"},{"key":"CR13","unstructured":"H. Edelsbrunner, A time- and space-optimal solution for the planar all intersecting rectangles problem, Inst. for Informationsverarbeitung, TU Graz, Bericht 50, (April 1980)."},{"key":"CR14","unstructured":"E. M. McGreight, Efficient algorithms for enumerating intersecting intervals and rectangles, Res. Rep. CSL-80-9, Xerox PARC, Palo Alto, California, (June 1980)."},{"key":"CR15","volume-title":"The Art of Computer Programming, Vol. 3: Sorting and Searching","author":"D. E. Knuth","year":"1973","unstructured":"D. E. Knuth,The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley, Reading, Massachusetts, 1973."},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"H. N. Gabow and R. E. Tarjan, A linear time algorithm for a special case of disjoint set union problem,Proc. 15th ACM Symp. Theory of Computing, pp. 246?251, (April 1983).","DOI":"10.1145\/800061.808753"},{"key":"CR17","volume-title":"The Designand Analysis of Efficient Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Designand Analysis of Efficient Computer Algorithms, Addison-Wesley, Reading, Massachusetts, 1974."}],"container-title":["International Journal of Computer & Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00989481.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00989481\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00989481","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T13:32:31Z","timestamp":1586179951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00989481"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,2]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,2]]}},"alternative-id":["BF00989481"],"URL":"https:\/\/doi.org\/10.1007\/bf00989481","relation":{},"ISSN":["0091-7036","1573-7640"],"issn-type":[{"value":"0091-7036","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,2]]}}}