Visibility From Infinity: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:Visibility From Infinity (Geometric Visibility Problems)}} == Description == Given a set $S$ of axis-parallel line segments in the plane and one particular horizontal segments $s$, determine whether there is a point on $s$ that can be seen from infinity, that is, whether there exists an infinite ray starting at the point on $s$ that does not intersect any segment. == Related Problems == Related: Visibility Between Segments, Visible Triangle =...") |
No edit summary |
||
(One intermediate revision by the same user not shown) | |||
Line 10: | Line 10: | ||
== Parameters == | == Parameters == | ||
$n$: number of axis-parallel line segments | |||
== Table of Algorithms == | == Table of Algorithms == |
Latest revision as of 09:27, 10 April 2023
Description
Given a set $S$ of axis-parallel line segments in the plane and one particular horizontal segments $s$, determine whether there is a point on $s$ that can be seen from infinity, that is, whether there exists an infinite ray starting at the point on $s$ that does not intersect any segment.
Related Problems
Related: Visibility Between Segments, Visible Triangle
Parameters
$n$: number of axis-parallel 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 |