Max-Area Visible Polygon

Given a simple polygon $P$ , find a point $x$ inside $P$ such that the "visibility polygon" $V(x)$ has maximal area.

Parameters

$n$ : number of edges of $P$

Related Problems

Visibility Between Segments

Visibility From Infinity

Visible Triangle

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Insuffient Data to display table

Other relevant algorithms

Insuffient Data to display table