The following pages link to Covering Polygons Is Hard (Q4304059):
Displaying 26 items.
- The class cover problem with boxes (Q419500) (← links)
- Tools of mathematical modeling of arbitrary object packing problems (Q610987) (← links)
- A nearly optimal algorithm for covering the interior of an art gallery (Q632590) (← links)
- Complexities of efficient solutions of rectilinear polygon cover problems (Q676264) (← links)
- Covering orthogonal polygons with star polygons: The perfect graph approach (Q918225) (← links)
- A nearly optimal sensor placement algorithm for boundary coverage (Q941574) (← links)
- Finding a minimal cover for binary images: An optimal parallel algorithm (Q1175643) (← links)
- On the difficulty of triangulating three-dimensional nonconvex polyhedra (Q1182990) (← links)
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms (Q1735167) (← links)
- Isomorphism of spiral polygons (Q1816417) (← links)
- On \(k\)-convex point sets (Q2248736) (← links)
- Drawing borders efficiently (Q2272197) (← links)
- Optimization of the number and arrangement of circles of two radii for forming a \(k\)-covering of a bounded set (Q2332657) (← links)
- Covering grids and orthogonal polygons with periscope guards (Q2365810) (← links)
- Note on covering monotone orthogonal polygons with star-shaped polygons (Q2380027) (← links)
- Rectangle transformation problem (Q2415366) (← links)
- Covering Polygons with Rectangles (Q2988828) (← links)
- Exact Learning of Discretized Geometric Concepts (Q4210170) (← links)
- LINEAR-TIME 3-APPROXIMATION ALGORITHM FOR THE r-STAR COVERING PROBLEM (Q4650093) (← links)
- POINT VISIBILITY GRAPHS AND ${\mathcal O}$-CONVEX COVER (Q4682204) (← links)
- INNER-COVER OF NON-CONVEX SHAPES (Q4819335) (← links)
- A linear-time heuristic for minimum rectangular coverings (Extended abstract) (Q5055944) (← links)
- Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem (Q5452162) (← links)
- Computing coverage kernels under restricted settings (Q5919535) (← links)
- Efficiently answering top-k frequent term queries in temporal-categorical range (Q6065960) (← links)
- Close approximations of minimum rectangular coverings (extended abstract) (Q6567763) (← links)
