Add to ORKGWe give an $O(\sqrt{\log n})$ factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation algorithm for this problem with a $o(\log n)$ approximation factor
Guarding edges of polygons is a version of art gallery problem.The goal is finding the minimum numbe...
Abstract We present the first constant-factor approximation algorithm for a non-trivial instance of ...
Let P be a rectilinear simple polygon. The stabbing number of a partition of P into rectangles is th...
We give an $O(\sqrt{\log n})$ factor approximation algorithm for covering a rectilinear polygon with...
We give an $O(\sqrt{\log n})$ factor approximation algorithm for covering a rectilinear polygon with...
We consider the problem of covering arbitrary polygons with rectangles. The rectangles must lie enti...
We consider the problem of covering arbitrary polygons with rectangles. The rectangles must lie enti...
We show a constant factor approximation algorithm for interior guarding of monotone polygons. Using...
Abstract. We consider the problem of covering an orthogonal polygon with a minimum number of axis-pa...
Covering a polygon by a set of rectangles has many applications in the VLSI CAD area. In this thesis...
We consider the problem of covering an orthogonal polygon with a minimum number of axis-parallel rec...
This paper considers the geometric optimization problem of finding the Largest area axis-parallel Re...
Abstract. The stabbing number of a partition of a rectilinear polygon P into rectangles is the maxim...
AbstractThis paper considers the geometric optimization problem of finding the Largest area axis-par...
Decomposing a polygon into simple shapes is a basic problem in computational geometry, with applicat...
Guarding edges of polygons is a version of art gallery problem.The goal is finding the minimum numbe...
Abstract We present the first constant-factor approximation algorithm for a non-trivial instance of ...
Let P be a rectilinear simple polygon. The stabbing number of a partition of P into rectangles is th...
We give an $O(\sqrt{\log n})$ factor approximation algorithm for covering a rectilinear polygon with...
We give an $O(\sqrt{\log n})$ factor approximation algorithm for covering a rectilinear polygon with...
We consider the problem of covering arbitrary polygons with rectangles. The rectangles must lie enti...
We consider the problem of covering arbitrary polygons with rectangles. The rectangles must lie enti...
We show a constant factor approximation algorithm for interior guarding of monotone polygons. Using...
Abstract. We consider the problem of covering an orthogonal polygon with a minimum number of axis-pa...
Covering a polygon by a set of rectangles has many applications in the VLSI CAD area. In this thesis...
We consider the problem of covering an orthogonal polygon with a minimum number of axis-parallel rec...
This paper considers the geometric optimization problem of finding the Largest area axis-parallel Re...
Abstract. The stabbing number of a partition of a rectilinear polygon P into rectangles is the maxim...
AbstractThis paper considers the geometric optimization problem of finding the Largest area axis-par...
Decomposing a polygon into simple shapes is a basic problem in computational geometry, with applicat...
Guarding edges of polygons is a version of art gallery problem.The goal is finding the minimum numbe...
Abstract We present the first constant-factor approximation algorithm for a non-trivial instance of ...
Let P be a rectilinear simple polygon. The stabbing number of a partition of P into rectangles is th...