{"quality_controlled":"1","publication_status":"published","language":[{"iso":"eng"}],"month":"09","publist_id":"1994","publisher":"Taylor & Francis","date_created":"2018-12-11T12:07:06Z","page":"221 - 229","title":"A new approach to rectangle intersections part 2","year":"1983","extern":"1","citation":{"short":"H. Edelsbrunner, International Journal of Computer Mathematics 13 (1983) 221–229.","ama":"Edelsbrunner H. A new approach to rectangle intersections part 2. <i>International Journal of Computer Mathematics</i>. 1983;13(3-4):221-229. doi:<a href=\"https://doi.org/10.1080/00207168308803365\">10.1080/00207168308803365</a>","mla":"Edelsbrunner, Herbert. “A New Approach to Rectangle Intersections Part 2.” <i>International Journal of Computer Mathematics</i>, vol. 13, no. 3–4, Taylor &#38; Francis, 1983, pp. 221–29, doi:<a href=\"https://doi.org/10.1080/00207168308803365\">10.1080/00207168308803365</a>.","ieee":"H. Edelsbrunner, “A new approach to rectangle intersections part 2,” <i>International Journal of Computer Mathematics</i>, vol. 13, no. 3–4. Taylor &#38; Francis, pp. 221–229, 1983.","apa":"Edelsbrunner, H. (1983). A new approach to rectangle intersections part 2. <i>International Journal of Computer Mathematics</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/00207168308803365\">https://doi.org/10.1080/00207168308803365</a>","chicago":"Edelsbrunner, Herbert. “A New Approach to Rectangle Intersections Part 2.” <i>International Journal of Computer Mathematics</i>. Taylor &#38; Francis, 1983. <a href=\"https://doi.org/10.1080/00207168308803365\">https://doi.org/10.1080/00207168308803365</a>.","ista":"Edelsbrunner H. 1983. A new approach to rectangle intersections part 2. International Journal of Computer Mathematics. 13(3–4), 221–229."},"oa_version":"None","article_processing_charge":"No","intvolume":"        13","author":[{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"}],"issue":"3-4","date_updated":"2022-01-25T12:33:10Z","date_published":"1983-09-01T00:00:00Z","abstract":[{"lang":"eng","text":"The study begun in Part I is completed by providing an algorithm which reports all intersecting pairs of a set of rectangles in d dimensions. This approach yields a solution which is optimal in time and space for planar rectangles and reasonable in higher dimensions."}],"publication_identifier":{"eissn":["1029-0265"],"issn":["0020-7160"]},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","doi":"10.1080/00207168308803365","article_type":"original","status":"public","volume":13,"publication":"International Journal of Computer Mathematics","_id":"4127","type":"journal_article","day":"01","scopus_import":"1"}