Separator2 (Geometric Separator Problems)
Jump to navigation
Jump to search
Description
Given a set $S$ of $n$ closed, non-intersecting (nor touching), axis-parallel line segments, is there a separator?
Related Problems
Related: Separator1
Parameters
$n$: number of line segments
Table of Algorithms
Currently no algorithms in our database for the given problem.
Reductions FROM Problem
| Problem | Implication | Year | Citation | Reduction |
|---|---|---|---|---|
| GeomBase | if: to-time $N^{2-\epsilon}$ for some $\epsilon > {0}$ then: from-time: $N^{2-\epsilon'}$ for some $\epsilon' > {0}$ |
1995 | https://doi-org.ezproxy.canberra.edu.au/10.1016/0925-7721(95)00022-2 | link |