Lably
Skip to content

Visibility polygon

  • 13 min read
  • 3 chapters

Related on Lably

Through Polygon, Robotics and Line (geometry)

If the visibility polygon is bounded then it is a star-shaped polygon. A visibility polygon is bounded if all rays shooting from the point eventually terminate in some obstacle. This is the case, e.g., if the obstacles are the edges of a simple polygon and p is inside the polygon. In the latter case the visibility polygon may be found in linear time.

Definitions

Formally, we can define the planar visibility polygon problem as such. Let S be a set of obstacles (either segments, or polygons) in R2. Let p be a point in R2 that is not within an obstacle. Then, the point visibility polygon V is the set of points in R2, such that for every point q in V, the segment pq does not intersect any obstacle in S.

Likewise, the segment visibility polygon or edge visibility polygon is the portion visible to any point along a line segment.

Sign in to keep reading

2 more chapters are free with a Lably account.

More in Topics in mathematics