Strips Cover Box (Geometric Covering Problems)

From Algorithm Wiki
Revision as of 10:29, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Strips Cover Box (Geometric Covering Problems)}} == Description == Given a set of strips in the plane, does their union contain a given axis-parallel rectangle? == Related Problems == Related: Triangles Cover Triangle, Hole in Union, Triangle Measure, Point Covering, Max-Weight Rectangle, Weighted Depth == Parameters == <pre>n: number of strips</pre> == Table of Algorithms == Currently no algorithms in our database for th...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Description

Given a set of strips in the plane, does their union contain a given axis-parallel rectangle?

Related Problems

Related: Triangles Cover Triangle, Hole in Union, Triangle Measure, Point Covering, Max-Weight Rectangle, Weighted Depth

Parameters

n: number of strips

Table of Algorithms

Currently no algorithms in our database for the given problem.

Reductions TO Problem

Problem Implication Year Citation Reduction
Triangles Cover Triangle if: to-time $N^{2-\epsilon}$ for some $\epsilon > {0}$
then: from-time: $N^{2-\epsilon'}$ for some $\epsilon' > {0}$
1995 https://doi-org.ezproxy.canberra.edu.au/10.1016/0925-7721(95)00022-2 link
Point Covering if: to-time $N^{2-\epsilon}$ for some $\epsilon > {0}$
then: from-time: $N^{2-\epsilon'}$ for some $\epsilon' > {0}$
1995 https://doi-org.ezproxy.canberra.edu.au/10.1016/0925-7721(95)00022-2 link

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.ezproxy.canberra.edu.au/10.1016/0925-7721(95)00022-2 link