Bisecting three classes of lines
From MaRDI portal
Publication:2230403
DOI10.1016/j.comgeo.2021.101775OpenAlexW3158523779MaRDI QIDQ2230403
Alexander Pilz, Patrick Schnider
Publication date: 17 September 2021
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.04419
Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) General convexity (52Axx) Computing methodologies and applications (68Uxx) Polytopes and polyhedra (52Bxx)
Related Items (2)
Cites Work
- Unnamed Item
- Semispaces of configurations, cell complexes of arrangements
- Sorting in \(c \log n\) parallel steps
- Algorithms for ham-sandwich cuts
- On minimum and maximum spanning trees of linearly moving points
- Improved bounds for planar \(k\)-sets and related problems
- Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\)
- Lines in space: Combinatorics and algorithms
- Ham-sandwich cuts and center transversals in subspaces
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Data Structures for Mobile Data
- Voronoi Diagrams of Moving Points
- Constructing Belts in Two-Dimensional Arrangements with Applications
- Weighted Ham-Sandwich Cuts
- Sweeps, arrangements and signotopes
- Maintaining the extent of a moving point set
This page was built for publication: Bisecting three classes of lines
