On a Class of 3SUM-HARD problems in Computational Geometry
Cutting a polygon with a line
Versandkostenfrei!
Versandfertig in 6-10 Tagen
32,99 €
inkl. MwSt.
PAYBACK Punkte
16 °P sammeln!
Given a simple polygon P and an integer K 1, wewant to compute the set ofstraight lines in the Cartesian plane that cut thispolygon into exactly K simplepolygons. We call this set of lines a K-separator andcall this problem the K-separatorproblem.We present an algorithm that finds the K-separatorsof an n-vertex simple polygon,for all K 0, in O(n2) total time.We prove that the decision problem given an integer K 2 and an edge of thepolygon, is there a line through this edge that cutsthe polygon in exactly K pieces?, is3SUM-HARD. For the special case when K = 2, we showthat the decision problemc...
Given a simple polygon P and an integer K 1, we
want to compute the set of
straight lines in the Cartesian plane that cut this
polygon into exactly K simple
polygons. We call this set of lines a K-separator and
call this problem the K-separator
problem.
We present an algorithm that finds the K-separators
of an n-vertex simple polygon,
for all K 0, in O(n2) total time.
We prove that the decision problem given an integer K 2 and an edge of the
polygon, is there a line through this edge that cuts
the polygon in exactly K pieces?, is
3SUM-HARD. For the special case when K = 2, we show
that the decision problem
can be solved in O(n log(n)) time.
Several other complexity results may be obtained. We
suspect that the problem
of finding the cell of maximum depth is also
3SUM-hard, and as a corollary the
problem of identifying the line that cuts the polygon
in the maximum possible number
of pieces is also 3SUM-hard.
want to compute the set of
straight lines in the Cartesian plane that cut this
polygon into exactly K simple
polygons. We call this set of lines a K-separator and
call this problem the K-separator
problem.
We present an algorithm that finds the K-separators
of an n-vertex simple polygon,
for all K 0, in O(n2) total time.
We prove that the decision problem given an integer K 2 and an edge of the
polygon, is there a line through this edge that cuts
the polygon in exactly K pieces?, is
3SUM-HARD. For the special case when K = 2, we show
that the decision problem
can be solved in O(n log(n)) time.
Several other complexity results may be obtained. We
suspect that the problem
of finding the cell of maximum depth is also
3SUM-hard, and as a corollary the
problem of identifying the line that cuts the polygon
in the maximum possible number
of pieces is also 3SUM-hard.
Andere Kunden interessierten sich für
