Rectilinear polygons are important in sensor location problems since they model the floor of many building. Tasks such as surveillance require observing the interior of a polygonal environment (interior covering, IC), while for inspection or image based rendering observing the boundary (edge covering, EC) is sufficient. In this note we analyse EC for rectilinear polygons and compare it with IC
Guarding of an environment by cameras or guards is a longstanding problem in computational geometry....
This paper presents a new optimal algorithm for locating a set of sensors in 3D able to see the boun...
A polygon P is x-monotone if any line orthogonal to the x-axis has a simply connected intersection w...
Rectilinear polygons are important in sensor location problems since they model the floor of many bu...
The paper introduces a shape measure intended to describe the extent to which a closed polygon is re...
. We consider two optimization problems with geometric structures. The first one concerns the follow...
We show a constant factor approximation algorithm for interior guarding ofmonotone polygons. Using t...
The problem of locating visual sensors can be often modeled as 2D Art Gallery problems. In particula...
Decomposing a polygon into simple shapes is a basic problem in computational geometry, with applicat...
Covering a polygon by a set of rectangles has many applications in the VLSI CAD area. In this thesis...
In this thesis it is demonstrated that the structure of rectilinear polygons can be exploited to sol...
1.1 Definitions................................... 4 1.2 Structure and current knowledge...............
We study the problem of externally guarding or inspecting a polygonal environment with a mobile guar...
Two new methods for computing the rectilinearity of polygons are presented. They provide shape measu...
Like convexity, the notion of visibility is a fundamental geometric property. It lends new geometric...
Guarding of an environment by cameras or guards is a longstanding problem in computational geometry....
This paper presents a new optimal algorithm for locating a set of sensors in 3D able to see the boun...
A polygon P is x-monotone if any line orthogonal to the x-axis has a simply connected intersection w...
Rectilinear polygons are important in sensor location problems since they model the floor of many bu...
The paper introduces a shape measure intended to describe the extent to which a closed polygon is re...
. We consider two optimization problems with geometric structures. The first one concerns the follow...
We show a constant factor approximation algorithm for interior guarding ofmonotone polygons. Using t...
The problem of locating visual sensors can be often modeled as 2D Art Gallery problems. In particula...
Decomposing a polygon into simple shapes is a basic problem in computational geometry, with applicat...
Covering a polygon by a set of rectangles has many applications in the VLSI CAD area. In this thesis...
In this thesis it is demonstrated that the structure of rectilinear polygons can be exploited to sol...
1.1 Definitions................................... 4 1.2 Structure and current knowledge...............
We study the problem of externally guarding or inspecting a polygonal environment with a mobile guar...
Two new methods for computing the rectilinearity of polygons are presented. They provide shape measu...
Like convexity, the notion of visibility is a fundamental geometric property. It lends new geometric...
Guarding of an environment by cameras or guards is a longstanding problem in computational geometry....
This paper presents a new optimal algorithm for locating a set of sensors in 3D able to see the boun...
A polygon P is x-monotone if any line orthogonal to the x-axis has a simply connected intersection w...