{"citation":{"mla":"Chazelle, Bernard, et al. “Lines in Space: Combinatorics and Algorithms.” <i>Algorithmica</i>, vol. 15, no. 5, Springer, 1996, pp. 428–47, doi:<a href=\"https://doi.org/10.1007/BF01955043\">10.1007/BF01955043</a>.","short":"B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, J. Stolfi, Algorithmica 15 (1996) 428–447.","ista":"Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Stolfi J. 1996. Lines in space: Combinatorics and algorithms. Algorithmica. 15(5), 428–447.","ieee":"B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and J. Stolfi, “Lines in space: Combinatorics and algorithms,” <i>Algorithmica</i>, vol. 15, no. 5. Springer, pp. 428–447, 1996.","ama":"Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Stolfi J. Lines in space: Combinatorics and algorithms. <i>Algorithmica</i>. 1996;15(5):428-447. doi:<a href=\"https://doi.org/10.1007/BF01955043\">10.1007/BF01955043</a>","chicago":"Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Jorge Stolfi. “Lines in Space: Combinatorics and Algorithms.” <i>Algorithmica</i>. Springer, 1996. <a href=\"https://doi.org/10.1007/BF01955043\">https://doi.org/10.1007/BF01955043</a>.","apa":"Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., &#38; Stolfi, J. (1996). Lines in space: Combinatorics and algorithms. <i>Algorithmica</i>. Springer. <a href=\"https://doi.org/10.1007/BF01955043\">https://doi.org/10.1007/BF01955043</a>"},"publist_id":"2100","abstract":[{"text":"Questions about lines in space arise frequently as subproblems in three-dimensional computational geometry. In this paper we study a number of fundamental combinatorial and algorithmic problems involving arrangements of n lines in three-dimensional space. Our main results include: 1. A tight Θ(n2) bound on the maximum combinatorial description complexity of the set of all oriented lines that have specified orientations relative to the n given lines. 2. A similar bound of Θ(n3) for the complexity of the set of all lines passing above the n given lines. 3. A preprocessing procedure using O(n2+ε) time and storage, for any ε &gt; 0, that builds a structure supporting O(logn)-time queries for testing if a line lies above all the given lines. 4. An algorithm that tests the &quot;towering property&quot; in O(n4/3+ε) time, for any ε &gt; 0: do n given red lines lie all above n given blue lines? The tools used to obtain these and other results include Plücker coordinates for lines in space and ε-nets for various geometric range spaces.","lang":"eng"}],"language":[{"iso":"eng"}],"type":"journal_article","year":"1996","volume":15,"date_published":"1996-05-01T00:00:00Z","oa_version":"None","article_type":"original","date_updated":"2022-08-09T09:55:46Z","publication":"Algorithmica","publisher":"Springer","status":"public","day":"01","scopus_import":"1","author":[{"full_name":"Chazelle, Bernard","last_name":"Chazelle","first_name":"Bernard"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"},{"first_name":"Leonidas","last_name":"Guibas","full_name":"Guibas, Leonidas"},{"first_name":"Micha","last_name":"Sharir","full_name":"Sharir, Micha"},{"first_name":"Jorge","full_name":"Stolfi, Jorge","last_name":"Stolfi"}],"publication_identifier":{"issn":["0178-4617"]},"_id":"4027","quality_controlled":"1","intvolume":"        15","extern":"1","acknowledgement":"Work on this paper by Bernard Chazelle has been supported by NSF Grant CCR-87-00917. Work on this paper by Herbert Edelsbrunner has been supported by NSF Grant CCR-87-14565. Work on this paper by Leonidas Guibas has been supported by grants from the Mitsubishi and Toshiba Corporations. Work on this paper by Micha Sharir has been supported by ONR Grant N00014-87-K-0129, by NSF Grants DCR-83-20085 and CCR-89-01484, and by grants from the U.S.-Israeli Binational Science Foundation, the NCRD — the Israeli National Council for Research and Development, and the EMET Fund of the Israeli Academy of Sciences.","month":"05","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","title":"Lines in space: Combinatorics and algorithms","doi":"10.1007/BF01955043","article_processing_charge":"No","page":"428 - 447","publication_status":"published","issue":"5","date_created":"2018-12-11T12:06:31Z"}