{"scopus_import":"1","conference":{"start_date":"1990-10-22","location":"St. Louis, MO, United States of America","end_date":"1990-10-24","name":"FOCS: Foundations of Computer Science"},"date_created":"2018-12-11T12:06:47Z","title":"Counting and cutting cycles of lines and rods in space","publisher":"IEEE","publication":"31st Annual Symposium on Foundations of Computer Science","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","month":"01","date_updated":"2022-02-17T11:07:07Z","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/89543"}],"publication_status":"published","day":"01","article_processing_charge":"No","page":"242 - 251","status":"public","doi":"10.1109/FSCS.1990.89543","quality_controlled":"1","year":"1990","oa_version":"None","extern":"1","date_published":"1990-01-01T00:00:00Z","abstract":[{"text":"A number of rendering algorithms in computer graphics sort three-dimensional objects by depth and assume that there is no cycle that makes the sorting impossible. One way to resolve the problem caused by cycles is to cut the objects into smaller pieces. The problem of estimating how many such cuts are always sufficient is addressed. A few related algorithmic and combinatorial geometry problems are considered.","lang":"eng"}],"author":[{"full_name":"Chazelle, Bernard","last_name":"Chazelle","first_name":"Bernard"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert"},{"last_name":"Guibas","full_name":"Guibas, Leonidas","first_name":"Leonidas"},{"first_name":"Richard","last_name":"Pollack","full_name":"Pollack, Richard"},{"first_name":"Raimund","last_name":"Seidel","full_name":"Seidel, Raimund"},{"last_name":"Sharir","full_name":"Sharir, Micha","first_name":"Micha"},{"full_name":"Snoeyink, Jack","last_name":"Snoeyink","first_name":"Jack"}],"citation":{"chicago":"Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, and Jack Snoeyink. “Counting and Cutting Cycles of Lines and Rods in Space.” In <i>31st Annual Symposium on Foundations of Computer Science</i>, 242–51. IEEE, 1990. <a href=\"https://doi.org/10.1109/FSCS.1990.89543\">https://doi.org/10.1109/FSCS.1990.89543</a>.","apa":"Chazelle, B., Edelsbrunner, H., Guibas, L., Pollack, R., Seidel, R., Sharir, M., &#38; Snoeyink, J. (1990). Counting and cutting cycles of lines and rods in space. In <i>31st Annual Symposium on Foundations of Computer Science</i> (pp. 242–251). St. Louis, MO, United States of America: IEEE. <a href=\"https://doi.org/10.1109/FSCS.1990.89543\">https://doi.org/10.1109/FSCS.1990.89543</a>","short":"B. Chazelle, H. Edelsbrunner, L. Guibas, R. Pollack, R. Seidel, M. Sharir, J. Snoeyink, in:, 31st Annual Symposium on Foundations of Computer Science, IEEE, 1990, pp. 242–251.","mla":"Chazelle, Bernard, et al. “Counting and Cutting Cycles of Lines and Rods in Space.” <i>31st Annual Symposium on Foundations of Computer Science</i>, IEEE, 1990, pp. 242–51, doi:<a href=\"https://doi.org/10.1109/FSCS.1990.89543\">10.1109/FSCS.1990.89543</a>.","ista":"Chazelle B, Edelsbrunner H, Guibas L, Pollack R, Seidel R, Sharir M, Snoeyink J. 1990. Counting and cutting cycles of lines and rods in space. 31st Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science, 242–251.","ieee":"B. Chazelle <i>et al.</i>, “Counting and cutting cycles of lines and rods in space,” in <i>31st Annual Symposium on Foundations of Computer Science</i>, St. Louis, MO, United States of America, 1990, pp. 242–251.","ama":"Chazelle B, Edelsbrunner H, Guibas L, et al. Counting and cutting cycles of lines and rods in space. In: <i>31st Annual Symposium on Foundations of Computer Science</i>. IEEE; 1990:242-251. doi:<a href=\"https://doi.org/10.1109/FSCS.1990.89543\">10.1109/FSCS.1990.89543</a>"},"publist_id":"2047","publication_identifier":{"isbn":["0-8186-2082-X"]},"_id":"4073","type":"conference","language":[{"iso":"eng"}]}