Counting and cutting cycles of lines and rods in space
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.
Download
No fulltext has been uploaded. References only!
Conference Paper
| Published
| English
Scopus indexed
Author
Chazelle, Bernard;
Edelsbrunner, HerbertISTA 
;
Guibas, Leonidas;
Pollack, Richard;
Seidel, Raimund;
Sharir, Micha;
Snoeyink, Jack
;
Guibas, Leonidas;
Pollack, Richard;
Seidel, Raimund;
Sharir, Micha;
Snoeyink, JackAbstract
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.
Publishing Year
Date Published
1990-01-01
Proceedings Title
31st Annual Symposium on Foundations of Computer Science
Page
242 - 251
Conference
FOCS: Foundations of Computer Science
Conference Location
St. Louis, MO, United States of America
Conference Date
1990-10-22 – 1990-10-24
ISBN
IST-REx-ID
Cite this
Chazelle B, Edelsbrunner H, Guibas L, et al. Counting and cutting cycles of lines and rods in space. In: 31st Annual Symposium on Foundations of Computer Science. IEEE; 1990:242-251. doi:10.1109/FSCS.1990.89543
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. In 31st Annual Symposium on Foundations of Computer Science (pp. 242–251). St. Louis, MO, United States of America: IEEE. https://doi.org/10.1109/FSCS.1990.89543
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 31st Annual Symposium on Foundations of Computer Science, 242–51. IEEE, 1990. https://doi.org/10.1109/FSCS.1990.89543.
B. Chazelle et al., “Counting and cutting cycles of lines and rods in space,” in 31st Annual Symposium on Foundations of Computer Science, St. Louis, MO, United States of America, 1990, pp. 242–251.
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.
Chazelle, Bernard, et al. “Counting and Cutting Cycles of Lines and Rods in Space.” 31st Annual Symposium on Foundations of Computer Science, IEEE, 1990, pp. 242–51, doi:10.1109/FSCS.1990.89543.
Google Scholar
ISBN Search