On lines avoiding unit balls in three dimensions

DOI10.1145/997817.997826MaRDI QIDQ5361652zbMATH OpenOpenAlexFDO

Authors Vladlen Koltun, Pankaj K. Agarwal, Boris Aronov, Micha Sharir

Publication date 29 September 2017

Published in Proceedings of the twentieth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/997817.997826

zbMATH Keywords

combinatorial complexitylines in spacevisibility

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Lines avoiding unit balls in three dimensions
• Lines avoiding balls in three dimensions revisited
• Lines avoiding balls in three dimensions revisited
• On the complexity of sets of free lines and line segments among balls in three dimensions
• On the complexity of sets of free lines and line segments among balls in three dimensions

Cited in

(7)

• Lines avoiding unit balls in three dimensions
• On the complexity of sets of free lines and line segments among balls in three dimensions
• Lines avoiding balls in three dimensions revisited
• On the complexity of sets of free lines and line segments among balls in three dimensions
• Lines avoiding balls in three dimensions revisited
• A pair in a crowd of unit balls
• Line intersection searching amid unit balls in 3-space

This page was built for publication: On lines avoiding unit balls in three dimensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361652)