Covering Polygons Is Hard
From MaRDI portal
Recommendations
- Beyond triangulation: covering polygons with triangles
- Complexities of efficient solutions of rectilinear polygon cover problems
- NP-harte Probleme für minimale Polygonüberdeckungen. (NP-hard problems for minimal polygon coverings)
- Further NP-hard problems for minimal polygon coverings
- scientific article; zbMATH DE number 4117851
Cited in
(51)- Finding a minimal cover for binary images: An optimal parallel algorithm
- On the difficulty of triangulating three-dimensional nonconvex polyhedra
- Minimum vertex hulls for polyhedral domains
- Further NP-hard problems for minimal polygon coverings
- On some polyhedra covering problems
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- Isomorphism of spiral polygons
- On \(k\)-convex point sets
- Drawing borders efficiently
- Optimization of the number and arrangement of circles of two radii for forming a \(k\)-covering of a bounded set
- Covering grids and orthogonal polygons with periscope guards
- Note on covering monotone orthogonal polygons with star-shaped polygons
- Rectangle transformation problem
- CONY, an algorithm for a nonoverlapping covering of a nonconvex multipy connected polygon by simply connected sets.
- Covering oriented points in the plane with orthogonal polygons is NP-complete
- Dissection with the fewest pieces is hard, even to approximate
- Covering polygons with rectangles
- Optimal space coverage with white convex polygons
- scientific article; zbMATH DE number 4206037 (Why is no real title available?)
- On the Complexity of Nonconvex Covering
- The class cover problem with boxes
- scientific article; zbMATH DE number 4128383 (Why is no real title available?)
- Exact Learning of Discretized Geometric Concepts
- scientific article; zbMATH DE number 1241846 (Why is no real title available?)
- scientific article; zbMATH DE number 2080277 (Why is no real title available?)
- Linear-time 3-approximation algorithm for the \(r\)-star covering problem
- POINT VISIBILITY GRAPHS AND ${\mathcal O}$-CONVEX COVER
- An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee
- scientific article; zbMATH DE number 4117851 (Why is no real title available?)
- scientific article; zbMATH DE number 1877049 (Why is no real title available?)
- INNER-COVER OF NON-CONVEX SHAPES
- Covering points with orthogonal polygons
- A linear-time heuristic for minimum rectangular coverings (Extended abstract)
- Beyond triangulation: covering polygons with triangles
- Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem
- Computational Science and Its Applications – ICCSA 2004
- Computing coverage kernels under restricted settings
- Efficiently answering top-k frequent term queries in temporal-categorical range
- Tools of mathematical modeling of arbitrary object packing problems
- Rectangularization of digital objects and its relation with straight skeletons
- A nearly optimal algorithm for covering the interior of an art gallery
- Close approximations of minimum rectangular coverings (extended abstract)
- Constructing concise convex covers via clique covers (CG challenge)
- Shadoks approach to convex covering (CG challenge)
- Complexities of efficient solutions of rectilinear polygon cover problems
- Constructing concise convex covers via clique covers
- Box covers and domain orderings for beyond worst-case join processing
- Covering simple orthogonal polygons with rectangles
- NP-harte Probleme für minimale Polygonüberdeckungen. (NP-hard problems for minimal polygon coverings)
- Covering orthogonal polygons with star polygons: The perfect graph approach
- A nearly optimal sensor placement algorithm for boundary coverage
This page was built for publication: Covering Polygons Is Hard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4304059)
