{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:24:05Z","timestamp":1725456245875},"publisher-location":"Berlin\/Heidelberg","reference-count":20,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354051516X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0015937","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T06:25:05Z","timestamp":1132727105000},"page":"161-168","source":"Crossref","is-referenced-by-count":0,"title":["The riches of rectangles"],"prefix":"10.1007","author":[{"given":"Derick","family":"Wood","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Technical Report","volume-title":"Output-sensitive hidden surface elimination for rectangles","author":"M.J. Atallah","year":"1988","unstructured":"M.J. Atallah and M.T. Goodrich. Output-sensitive hidden surface elimination for rectangles. Technical Report 88-13, The John Hopkin's University, Department of Computer Science, Baltimore, 1988."},{"key":"15_CR2","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1109\/TC.1980.1675628","volume":"EC-29","author":"J.L. Bentley","year":"1980","unstructured":"J.L. Bentley and D. Wood. An optimal worst case algorithm for reporting intersections of rectangles. IEEE Transactions on Computers, EC-29:571\u2013576, 1980.","journal-title":"IEEE Transactions on Computers"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"M. Bern. Hidden surface removal for rectangles. In Proceedings of the 4th ACM Symposium on Computational Geometry, pages 183\u2013192, 1988.","DOI":"10.1145\/73393.73412"},{"key":"15_CR4","unstructured":"H. Edelsbrunner. Dynamic rectangle intersection searching. Technical Report F 47, Institut f\u00fcr Informationsverarbeitung, Technische Universit\u00e4t Graz, 1980."},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1080\/00207168308803364","volume":"13","author":"H. Edelsbrunner","year":"1983","unstructured":"H. Edelsbrunner. New approach to rectangle intersections: Part I. International Journal of Computer Mathematics, 13:209\u2013219, 1983.","journal-title":"International Journal of Computer Mathematics"},{"key":"15_CR6","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1080\/00207168308803365","volume":"13","author":"H. Edelsbrunner","year":"1983","unstructured":"H. Edelsbrunner. New approach to rectangle intersections: Part II. International Journal of Computer Mathematics, 13:221\u2013229, 1983.","journal-title":"International Journal of Computer Mathematics"},{"key":"15_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, New York, 1987."},{"key":"15_CR8","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1051\/ita\/1984180201711","volume":"18","author":"H. Edelsbrunner","year":"1984","unstructured":"H. Edelsbrunner, J. van Leeuwen, Th. Ottmann, and D. Wood. Computing the connected components of simple rectilinear geometrical objects in d-space. RAIRO Informatique th\u00e9orique, 18:171\u2013183, 1984.","journal-title":"RAIRO Informatique th\u00e9orique"},{"key":"15_CR9","unstructured":"D.E. Field. Fast hit detection for disjoint rectangles. Technical Report 85-53, Department of Computer Science, University of Waterloo, 1985."},{"key":"15_CR10","series-title":"Technical Report","volume-title":"String graphs I: The number of critical nonstring graphs is infinite","author":"J. Kratochvil","year":"1988","unstructured":"J. Kratochvil. String graphs I: The number of critical nonstring graphs is infinite. Technical Report 88-83, Charles University, Department of Mathematics and Physics, Prague, Czechoslovakia, 1988."},{"key":"15_CR11","series-title":"Technical Report","volume-title":"String graphs II: Recognizing string graphs is NP-hard","author":"J. Kratochvil","year":"1988","unstructured":"J. Kratochvil. String graphs II: Recognizing string graphs is NP-hard. Technical Report 88-86, Charles University, Department of Mathematics and Physics, Prague, Czechoslovakia, 1988."},{"key":"15_CR12","unstructured":"E.M. McCreight. Efficient algorithms for enumerating intersecting intervals and rectangles. Technical Report CSL-80-9, Xerox Palo Alto Research Center, 1980."},{"key":"15_CR13","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1137\/0214021","volume":"14","author":"E.M. McCreight","year":"1985","unstructured":"E.M. McCreight. Priority search trees. SIAM Journal on Computing, 14:257\u2013276, 1985.","journal-title":"SIAM Journal on Computing"},{"key":"15_CR14","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"J. Nievergelt, H. Hinterberger, and K.C. Sevcik. The grid file: An adaptable, symmetric multikey file structure. ACM Transactions on Database Systems, 9:38\u201371, 1984.","journal-title":"ACM Transactions on Database Systems"},{"key":"15_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F.P. Preparata","year":"1985","unstructured":"F.P. Preparata and M.I. Shamos. Computational Geometry. Springer-Verlag, New York, 1985."},{"key":"15_CR16","series-title":"Technical Report","volume-title":"Computation of the axial view of a set of isothetic parallelopipeds","author":"F.P. Preparata","year":"1988","unstructured":"F.P. Preparata, J.S. Vitter, and M. Yvinec. Computation of the axial view of a set of isothetic parallelopipeds. Technical Report 88-1, Labatoire d'Informatique de l'Ecole Normale Sup\u00e9rieure, Paris, France, 1988."},{"key":"15_CR17","volume-title":"Graph Theory and Its Applications to Problems of Society","author":"F.S. Roberts","year":"197?","unstructured":"F.S. Roberts. Graph Theory and Its Applications to Problems of Society. Society for Industrial and Applied Mathematics, Philadelphia, Pennsylvania, 197?"},{"key":"15_CR18","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1145\/6138.6151","volume":"29","author":"N. Sarnak","year":"1986","unstructured":"N. Sarnak and R.E. Tarjan. Planar point location using persistent search trees. Communications of the ACM, 29:669\u2013679, 1986.","journal-title":"Communications of the ACM"},{"key":"15_CR19","unstructured":"H.-W. Six and P. Widmayer. Spatial searching in geometric databases. Technical Report 176, Institut f\u00fcr Angewandte Informatik, Universit\u00e4t Karlsruhe, 1987."},{"key":"15_CR20","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/TC.1982.1675973","volume":"C-31","author":"H.-W. Six","year":"1982","unstructured":"H.-W. Six and D. Wood. Counting and reporting intersections of d-ranges. IEEE Transactions on Computers, C-31:181\u2013187, 1982.","journal-title":"IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","Machines, Languages, and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0015937.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T15:10:10Z","timestamp":1607353810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015937"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354051516X"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0015937","relation":{},"subject":[]}}