On the complexity of sets of free lines and line segments among balls in three dimensions

DOI10.1145/1810959.1810969zbMath1284.52025OpenAlexW1998885045MaRDI QIDQ5405862

Sylvain Lazard, Marc Glisse

Publication date: 3 April 2014

Published in: Proceedings of the twenty-sixth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-00643880/file/dcg_revised.pdf

zbMATH Keywords

balls3D visibilityfree linesfree segmentsvisibility complex

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial complexity of geometric structures (52C45)

Related Items (1)

Lines avoiding balls in three dimensions revisited

This page was built for publication: On the complexity of sets of free lines and line segments among balls in three dimensions