Lines in space: Combinatorics and algorithms
From MaRDI portal
(Redirected from Publication:1913699)
Recommendations
Cites work
- scientific article; zbMATH DE number 4151829 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 50706 (Why is no real title available?)
- scientific article; zbMATH DE number 51258 (Why is no real title available?)
- scientific article; zbMATH DE number 52607 (Why is no real title available?)
- scientific article; zbMATH DE number 177534 (Why is no real title available?)
- scientific article; zbMATH DE number 3012556 (Why is no real title available?)
- scientific article; zbMATH DE number 3333104 (Why is no real title available?)
- scientific article; zbMATH DE number 3075369 (Why is no real title available?)
- A deterministic view of random sampling and its use in geometry
- Applications of random sampling in computational geometry. II
- Combinatorial complexity bounds for arrangements of curves and spheres
- Construction of \(\epsilon\)-nets
- Counting and cutting cycles of lines and rods in space
- Cutting hyperplane arrangements
- New applications of random sampling in computational geometry
- On \(k\)-sets in arrangements of curves and surfaces
- On joints in arrangements of lines in space and related problems
- On the Betti Numbers of Real Varieties
- The complexity and construction of many faces in arrangements of lines and of segments
- The complexity of many cells in arrangements of planes and related problems
- Weaving patterns of lines and line segments in space
- \(\epsilon\)-nets and simplex range queries
Cited in
(32)- scientific article; zbMATH DE number 177535 (Why is no real title available?)
- Improved bounds for incidences between points and circles
- The union of moving polygonal pseudodiscs -- combinatorial bounds and applications
- Algorithms for bichromatic line-segment problems and polyhedral terrains
- Ramsey-type theorems for lines in 3-space
- Crossing patterns of semi-algebraic sets
- Lines through segments in 3D space
- scientific article; zbMATH DE number 4212059 (Why is no real title available?)
- Finding stabbing lines in 3-space
- Generalized hidden surface removal
- Point location in zones of \(k\)-flats in arrangements
- On the complexity of sets of free lines and line segments among balls in three dimensions
- REGION INTERVISIBILITY IN TERRAINS
- Bisecting three classes of lines
- Clamshell casting
- On range searching with semialgebraic sets
- Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\)
- On lines missing polyhedral sets in 3-space
- scientific article; zbMATH DE number 66677 (Why is no real title available?)
- The power of parallel projection
- Partitioning arrangements of lines. II: Applications
- Configuration spaces of spatial linkages: Taking Collisions Into Account
- Ray shooting and stone throwing with near-linear storage
- Partitioning axis-parallel lines in 3D
- Almost tight upper bounds for lower envelopes in higher dimensions
- Counting and cutting cycles of lines and rods in space
- Applications of a new space-partitioning technique
- Line problems in nonlinear computational geometry
- On joints in arrangements of lines in space and related problems
- Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
- On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space
- On ray shooting for triangles in 3-space and related problems
This page was built for publication: Lines in space: Combinatorics and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1913699)
