Visibility From Infinity (Geometric Visibility Problems)

From Algorithm Wiki
Revision as of 09:27, 10 April 2023 by Admin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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