Approximate Max-Area Visible Polygon

Given a simple polygon $P$ and a parameter $\epsilon$ , find a point $x$ inside $P$ such that the "visibility polygon" $V(x)$ has area within a $(1-\epsilon)$ factor of the largest possible area of the visibility polygon.

Parameters

$n$ : number of edges of $P$
$\epsilon$ : approximation parameter

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Displaying 1 of 1 reductions

			See more
Point on 3 Lines	Approximate Max-Area Visible Polygon	2007

Other relevant algorithms