Separator2: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:Separator2 (Geometric Separator Problems)}} == 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 == <pre>n: number of line segments</pre> == Table of Algorithms == Currently no algorithms in our database for the given problem. == Reductions FROM Problem == {| class="wikitable sortable" style="text-align...") |
No edit summary |
||
| (One intermediate revision by the same user not shown) | |||
| Line 10: | Line 10: | ||
== Parameters == | == Parameters == | ||
$n$: number of line segments | |||
== Table of Algorithms == | == Table of Algorithms == | ||
Latest revision as of 08:27, 10 April 2023
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/10.1016/0925-7721(95)00022-2 | link |