Lower bounds for line stabbing
- 1 November 1989
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 33 (2) , 59-62
- https://doi.org/10.1016/0020-0190(89)90155-5
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Stabbing pairwise disjoint translates in linear timePublished by Association for Computing Machinery (ACM) ,1989
- Algorithms for High Dimensional Stabbing ProblemsPublished by Springer Nature ,1988
- Efficient algorithms for common transversalsInformation Processing Letters, 1987
- Geometric permutations and common transversalsDiscrete & Computational Geometry, 1986
- A conjecture of Grünbaum on common transversals.MATHEMATICA SCANDINAVICA, 1986
- Finding transversals for sets of simple geometric figuresTheoretical Computer Science, 1985
- Linear Time Algorithms for Two- and Three-Variable Linear ProgramsSIAM Journal on Computing, 1984
- Stabbing line segmentsBIT Numerical Mathematics, 1982
- Thin sets and common transversalsJournal of Geometry, 1980
- On common transversalsArchiv der Mathematik, 1958