{"year":"2002","page":"143 - 172","type":"journal_article","article_processing_charge":"No","date_updated":"2023-06-13T11:20:09Z","publication_status":"published","extern":"1","publisher":"World Scientific Publishing","language":[{"iso":"eng"}],"quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_type":"original","date_published":"2002-01-01T00:00:00Z","publist_id":"2128","status":"public","oa_version":"None","_id":"4000","publication":"International Journal of Computational Geometry and Applications","volume":12,"abstract":[{"text":"We present fast implementations of a hybrid algorithm for reporting box and cube intersections. Our algorithm initially takes a divide-and-conquer approach and switches to simpler algorithms for low numbers of boxes. We use our implementations as engines to solve problems about geometric primitives. We look at two such problems in the category of quality analysis of surface triangulations.","lang":"eng"}],"doi":"10.1142/S0218195902000785","month":"01","publication_identifier":{"issn":["0218-1959"]},"acknowledgement":"Center for Simulation of Advanced Rockets funded by the U.S. Department of Energy under Subcontract B341494, NSF under grant CCR-96-19542 and ARO under grant DAAG55-98-1-0177.","title":"Fast software for box intersections","day":"01","date_created":"2018-12-11T12:06:22Z","author":[{"first_name":"Afra","last_name":"Zomorodian","full_name":"Zomorodian, Afra"},{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"}],"scopus_import":"1","intvolume":"        12","citation":{"mla":"Zomorodian, Afra, and Herbert Edelsbrunner. “Fast Software for Box Intersections.” <i>International Journal of Computational Geometry and Applications</i>, vol. 12, no. 1–2, World Scientific Publishing, 2002, pp. 143–72, doi:<a href=\"https://doi.org/10.1142/S0218195902000785\">10.1142/S0218195902000785</a>.","ieee":"A. Zomorodian and H. Edelsbrunner, “Fast software for box intersections,” <i>International Journal of Computational Geometry and Applications</i>, vol. 12, no. 1–2. World Scientific Publishing, pp. 143–172, 2002.","apa":"Zomorodian, A., &#38; Edelsbrunner, H. (2002). Fast software for box intersections. <i>International Journal of Computational Geometry and Applications</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0218195902000785\">https://doi.org/10.1142/S0218195902000785</a>","ama":"Zomorodian A, Edelsbrunner H. Fast software for box intersections. <i>International Journal of Computational Geometry and Applications</i>. 2002;12(1-2):143-172. doi:<a href=\"https://doi.org/10.1142/S0218195902000785\">10.1142/S0218195902000785</a>","ista":"Zomorodian A, Edelsbrunner H. 2002. Fast software for box intersections. International Journal of Computational Geometry and Applications. 12(1–2), 143–172.","short":"A. Zomorodian, H. Edelsbrunner, International Journal of Computational Geometry and Applications 12 (2002) 143–172.","chicago":"Zomorodian, Afra, and Herbert Edelsbrunner. “Fast Software for Box Intersections.” <i>International Journal of Computational Geometry and Applications</i>. World Scientific Publishing, 2002. <a href=\"https://doi.org/10.1142/S0218195902000785\">https://doi.org/10.1142/S0218195902000785</a>."},"issue":"1-2"}