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

    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)