Open AccessCutting triangular cycles of lines in space
Author(s) -
Boris Aronov,
Vladlen Koltun,
Micha Sharir
Publication year - 2003
Publication title -
citeseer x (the pennsylvania state university)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.1145/780542.780622
Subject(s) - computer graphics (images) , computational geometry , computer graphics , graphics , computer science , space (punctuation) , surface (topology) , geometry , algorithm , mathematics , operating system
We show 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. This partially resolves a long-standing open problem in computational geometry, motivated by hidden-surface removal in computer graphics.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom