Cutting triangular cycles of lines in space

Boris Aronov, Vladlen Koltun, Micha Sharir

    Research output: Contribution to journalArticle

    Abstract

    We show that n lines in 3-space can be cut into O(n2-1/69 log16/69 n) pieces, such that all depth cycles defined by triples of lines are eliminated. This partially resolves a long-standing open problem in computational geometry, motivated by hidden-surface removal in computer graphics.

    Original languageEnglish (US)
    Pages (from-to)231-247
    Number of pages17
    JournalDiscrete and Computational Geometry
    Volume33
    Issue number2
    DOIs
    StatePublished - 2005

    Fingerprint

    Computational geometry
    Computer graphics
    Triangular
    Cycle
    Line
    Computational Geometry
    Open Problems
    Resolve

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computational Theory and Mathematics
    • Discrete Mathematics and Combinatorics
    • Geometry and Topology

    Cite this

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

    In: Discrete and Computational Geometry, Vol. 33, No. 2, 2005, p. 231-247.

    Research output: Contribution to journalArticle

    Aronov, Boris ; Koltun, Vladlen ; Sharir, Micha. / Cutting triangular cycles of lines in space. In: Discrete and Computational Geometry. 2005 ; Vol. 33, No. 2. pp. 231-247.
    @article{ccf9c771e11f46398af688278bed8f8d,
    title = "Cutting triangular cycles of lines in space",
    abstract = "We show that n lines in 3-space can be cut into O(n2-1/69 log16/69 n) pieces, such that all depth cycles defined by triples of lines are eliminated. This partially resolves a long-standing open problem in computational geometry, motivated by hidden-surface removal in computer graphics.",
    author = "Boris Aronov and Vladlen Koltun and Micha Sharir",
    year = "2005",
    doi = "10.1007/s00454-004-1123-5",
    language = "English (US)",
    volume = "33",
    pages = "231--247",
    journal = "Discrete and Computational Geometry",
    issn = "0179-5376",
    publisher = "Springer New York",
    number = "2",

    }

    TY - JOUR

    T1 - Cutting triangular cycles of lines in space

    AU - Aronov, Boris

    AU - Koltun, Vladlen

    AU - Sharir, Micha

    PY - 2005

    Y1 - 2005

    N2 - We show that n lines in 3-space can be cut into O(n2-1/69 log16/69 n) pieces, such that all depth cycles defined by triples of lines are eliminated. This partially resolves a long-standing open problem in computational geometry, motivated by hidden-surface removal in computer graphics.

    AB - We show that n lines in 3-space can be cut into O(n2-1/69 log16/69 n) pieces, such that all depth cycles defined by triples of lines are eliminated. This partially resolves a long-standing open problem in computational geometry, motivated by hidden-surface removal in computer graphics.

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

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

    U2 - 10.1007/s00454-004-1123-5

    DO - 10.1007/s00454-004-1123-5

    M3 - Article

    VL - 33

    SP - 231

    EP - 247

    JO - Discrete and Computational Geometry

    JF - Discrete and Computational Geometry

    SN - 0179-5376

    IS - 2

    ER -