Bisecting three classes of lines
From MaRDI portal
Publication:2230403
Recommendations
Cites work
- scientific article; zbMATH DE number 1962801 (Why is no real title available?)
- Algorithms for ham-sandwich cuts
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Constructing Belts in Two-Dimensional Arrangements with Applications
- Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\)
- Data Structures for Mobile Data
- Ham-sandwich cuts and center transversals in subspaces
- Improved bounds for planar \(k\)-sets and related problems
- Lines in space: Combinatorics and algorithms
- Maintaining the extent of a moving point set
- On minimum and maximum spanning trees of linearly moving points
- Semispaces of configurations, cell complexes of arrangements
- Sorting in \(c \log n\) parallel steps
- Sweeps, arrangements and signotopes
- Voronoi Diagrams of Moving Points
- Weighted Ham-Sandwich Cuts
Cited in
(3)
This page was built for publication: Bisecting three classes of lines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2230403)