On lines missing polyhedral sets in 3-space
From MaRDI portal
Publication:1334933
DOI10.1007/BF02574376zbMath0822.68111MaRDI QIDQ1334933
Publication date: 26 September 1994
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131327
Related Items (3)
On the complexity of sets of free lines and line segments among balls in three dimensions ⋮ Lines avoiding balls in three dimensions revisited ⋮ The union of moving polygonal pseudodiscs -- combinatorial bounds and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity and construction of many faces in arrangements of lines and of segments
- A deterministic view of random sampling and its use in geometry
- Construction of \(\epsilon\)-nets
- Finding stabbing lines in 3-space
- Reporting points in halfspaces
- Algorithms for bichromatic line-segment problems and polyhedral terrains
- On the sum of squares of cell complexities in hyperplane arrangements
- New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
- New applications of random sampling in computational geometry
- Ray shooting on triangles in 3-space
- Linear Programming in Linear Time When the Dimension Is Fixed
- On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space
- Separating a polyhedron by one translation from a set of obstacles
This page was built for publication: On lines missing polyhedral sets in 3-space
