Covering simple orthogonal polygons with rectangles
From MaRDI portal
Cites work
- -nets and simplex range queries
- A hybrid heuristic for the rectilinear picture compression problem
- Almost optimal set covers in finite VC-dimension
- Approximating maximum independent set for rectangles in the plane
- Approximation algorithms for maximum independent set of pseudo-disks
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
- Approximation Schemes for Covering and Packing
- Approximation schemes for maximum weight independent set of rectangles
- Complexities of efficient solutions of rectilinear polygon cover problems
- Compressing rectilinear pictures and minimizing access control lists
- Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set
- Constant-factor approximation algorithms for convex cover and hidden set in a simple polygon
- Constructing planar support for non-piercing regions
- Covering polygons is even Harder
- Covering Polygons Is Hard
- Covering rectilinear polygons with area-weighted rectangles
- Covering Rectilinear Polygons with Axis-Parallel Rectangles
- Covering Regions by Rectangles
- Exact algorithms and APX-hardness results for geometric packing and covering problems
- Geometric Packing under Nonuniform Constraints
- Guarding terrains via local search
- scientific article; zbMATH DE number 5291457 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Hypergraph planarity and the complexity of drawing venn diagrams
- Improved approximation algorithms for geometric set cover
- Improved results on geometric hitting set problems
- Label placement by maximum independent set in rectangles
- Local search heuristic for k-median and facility location problems
- Local search strikes again: PTAS for variants of geometric covering and packing
- Maximum independent set of rectangles
- On planar supports for hypergraphs
- Packing and covering with non-piercing regions
- Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles
- Small-size -nets for axis-parallel rectangles and boxes
- Subdivision Drawings of Hypergraphs
- Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains
- Tight lower bounds for the size of epsilon-nets
- TRÉMAUX TREES AND PLANARITY
- Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
- Weighted geometric set cover via quasi-uniform sampling
This page was built for publication: Covering simple orthogonal polygons with rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346826)
