{"intvolume":"        13","extern":"1","quality_controlled":"1","_id":"4126","publication_identifier":{"eissn":["1029-0265"],"issn":["0020-7160"]},"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"}],"issue":"3-4","date_created":"2018-12-11T12:07:05Z","publication_status":"published","doi":"10.1080/00207168308803364","page":"209 - 219","article_processing_charge":"No","title":"A new approach to rectangle intersections part 1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","month":"09","oa_version":"None","date_published":"1983-09-01T00:00:00Z","volume":13,"year":"1983","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"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.","lang":"eng"}],"publist_id":"1993","citation":{"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>","ista":"Edelsbrunner H. 1983. A new approach to rectangle intersections part 1. International Journal of Computer Mathematics. 13(3–4), 209–219.","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.","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>.","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>","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>."},"scopus_import":"1","day":"01","status":"public","publisher":"Taylor & Francis","article_type":"original","date_updated":"2022-01-25T12:21:18Z","publication":"International Journal of Computer Mathematics"}