On lines missing polyhedral sets in 3-space
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3117214 (Why is no real title available?)
- scientific article; zbMATH DE number 3945379 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- A deterministic view of random sampling and its use in geometry
- Algorithms for bichromatic line-segment problems and polyhedral terrains
- Construction of \(\epsilon\)-nets
- Finding stabbing lines in 3-space
- Linear Programming in Linear Time When the Dimension Is Fixed
- New applications of random sampling in computational geometry
- New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
- On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space
- On the sum of squares of cell complexities in hyperplane arrangements
- Ray shooting on triangles in 3-space
- Reporting points in halfspaces
- Separating a polyhedron by one translation from a set of obstacles
- The complexity and construction of many faces in arrangements of lines and of segments
Cited in
(7)- The union of moving polygonal pseudodiscs -- combinatorial bounds and applications
- Line transversals of convex polyhedra in \(\mathbb{R}^3\)
- Lines through segments in 3D space
- On the complexity of sets of free lines and line segments among balls in three dimensions
- Predicates for line transversals to lines and line segments in three-dimensional space
- Lines avoiding balls in three dimensions revisited
- New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
This page was built for publication: On lines missing polyhedral sets in 3-space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334933)
