{"month":"09","date_updated":"2022-01-25T12:21:18Z","title":"A new approach to rectangle intersections part 1","scopus_import":"1","article_processing_charge":"No","date_created":"2018-12-11T12:07:05Z","type":"journal_article","citation":{"chicago":"Edelsbrunner, Herbert. “A New Approach to Rectangle Intersections Part 1.” <i>International Journal of Computer Mathematics</i>. Taylor &#38; Francis, 1983. <a href=\"https://doi.org/10.1080/00207168308803364\">https://doi.org/10.1080/00207168308803364</a>.","apa":"Edelsbrunner, H. (1983). A new approach to rectangle intersections part 1. <i>International Journal of Computer Mathematics</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/00207168308803364\">https://doi.org/10.1080/00207168308803364</a>","ama":"Edelsbrunner H. A new approach to rectangle intersections part 1. <i>International Journal of Computer Mathematics</i>. 1983;13(3-4):209-219. doi:<a href=\"https://doi.org/10.1080/00207168308803364\">10.1080/00207168308803364</a>","ieee":"H. Edelsbrunner, “A new approach to rectangle intersections part 1,” <i>International Journal of Computer Mathematics</i>, vol. 13, no. 3–4. Taylor &#38; Francis, pp. 209–219, 1983.","short":"H. Edelsbrunner, International Journal of Computer Mathematics 13 (1983) 209–219.","ista":"Edelsbrunner H. 1983. A new approach to rectangle intersections part 1. International Journal of Computer Mathematics. 13(3–4), 209–219.","mla":"Edelsbrunner, Herbert. “A New Approach to Rectangle Intersections Part 1.” <i>International Journal of Computer Mathematics</i>, vol. 13, no. 3–4, Taylor &#38; Francis, 1983, pp. 209–19, doi:<a href=\"https://doi.org/10.1080/00207168308803364\">10.1080/00207168308803364</a>."},"oa_version":"None","article_type":"original","status":"public","extern":"1","issue":"3-4","publisher":"Taylor & Francis","publication_identifier":{"issn":["0020-7160"],"eissn":["1029-0265"]},"abstract":[{"lang":"eng","text":"Rectangle intersections involving rectilinearly-oriented (hyper-) rectangles in d-dimensional real space are examined from two points of view. First, a data structure is developed which is efficient in time and space and allows us to report all d-dimensional rectangles stored which intersect a d-dimensional query rectangle. Second, in Part II, a slightly modified version of this new data structure is applied to report all intersecting pairs of rectangles of a given set. This approach yields a solution which is optimal in time and space for planar rectangles and reasonable in higher dimensions."}],"year":"1983","_id":"4126","volume":13,"author":[{"first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert"}],"doi":"10.1080/00207168308803364","publication_status":"published","day":"01","publication":"International Journal of Computer Mathematics","date_published":"1983-09-01T00:00:00Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"209 - 219","publist_id":"1993","language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"        13"}