Cutting triangular cycles of lines in space

Boris Aronov, Vladlen Koltun, Micha Sharir

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    The cutting triangular cycles of lines in space were investigated. It was shown that a collection of lines in 3-space can be cut into a subquadratic number of pieces, such that all depth cycles defined by triples of lines are eliminated. A long-standing open problem in computational geometry, motivated by hidden-surface removal in computer graphics, was solved.

    Original languageEnglish (US)
    Title of host publicationConference Proceedings of the Annual ACM Symposium on Theory of Computing
    Pages547-555
    Number of pages9
    StatePublished - 2003
    Event35th Annual ACM Symposium on Theory of Computing - San Diego, CA, United States
    Duration: Jun 9 2003Jun 11 2003

    Other

    Other35th Annual ACM Symposium on Theory of Computing
    CountryUnited States
    CitySan Diego, CA
    Period6/9/036/11/03

    Fingerprint

    Computational geometry
    Computer graphics

    Keywords

    • Cycles
    • Hidden-surface removal
    • Lines in space
    • Weavings

    ASJC Scopus subject areas

    • Software

    Cite this

    Aronov, B., Koltun, V., & Sharir, M. (2003). Cutting triangular cycles of lines in space. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 547-555)

    Cutting triangular cycles of lines in space. / Aronov, Boris; Koltun, Vladlen; Sharir, Micha.

    Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 2003. p. 547-555.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Aronov, B, Koltun, V & Sharir, M 2003, Cutting triangular cycles of lines in space. in Conference Proceedings of the Annual ACM Symposium on Theory of Computing. pp. 547-555, 35th Annual ACM Symposium on Theory of Computing, San Diego, CA, United States, 6/9/03.
    Aronov B, Koltun V, Sharir M. Cutting triangular cycles of lines in space. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 2003. p. 547-555
    Aronov, Boris ; Koltun, Vladlen ; Sharir, Micha. / Cutting triangular cycles of lines in space. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 2003. pp. 547-555
    @inproceedings{cb3db2c062af447385262a02221b7b5c,
    title = "Cutting triangular cycles of lines in space",
    abstract = "The cutting triangular cycles of lines in space were investigated. It was shown that a collection of lines in 3-space can be cut into a subquadratic number of pieces, such that all depth cycles defined by triples of lines are eliminated. A long-standing open problem in computational geometry, motivated by hidden-surface removal in computer graphics, was solved.",
    keywords = "Cycles, Hidden-surface removal, Lines in space, Weavings",
    author = "Boris Aronov and Vladlen Koltun and Micha Sharir",
    year = "2003",
    language = "English (US)",
    pages = "547--555",
    booktitle = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",

    }

    TY - GEN

    T1 - Cutting triangular cycles of lines in space

    AU - Aronov, Boris

    AU - Koltun, Vladlen

    AU - Sharir, Micha

    PY - 2003

    Y1 - 2003

    N2 - The cutting triangular cycles of lines in space were investigated. It was shown that a collection of lines in 3-space can be cut into a subquadratic number of pieces, such that all depth cycles defined by triples of lines are eliminated. A long-standing open problem in computational geometry, motivated by hidden-surface removal in computer graphics, was solved.

    AB - The cutting triangular cycles of lines in space were investigated. It was shown that a collection of lines in 3-space can be cut into a subquadratic number of pieces, such that all depth cycles defined by triples of lines are eliminated. A long-standing open problem in computational geometry, motivated by hidden-surface removal in computer graphics, was solved.

    KW - Cycles

    KW - Hidden-surface removal

    KW - Lines in space

    KW - Weavings

    UR - http://www.scopus.com/inward/record.url?scp=0038784528&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0038784528&partnerID=8YFLogxK

    M3 - Conference contribution

    SP - 547

    EP - 555

    BT - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

    ER -