This paper discusses the problem of covering and hitting a set of line segments L in R-2 by a pair of axis-parallel congruent squares of minimum size. We also discuss the restricted version of covering, where each lin...
详细信息
This paper discusses the problem of covering and hitting a set of line segments L in R-2 by a pair of axis-parallel congruent squares of minimum size. We also discuss the restricted version of covering, where each line segment in L is to be covered completely by at least one square. The proposed algorithms assume that the input segments are given in a read-only array. For each of these problems (i.e. covering, hitting and restricted covering problems), our proposed algorithm reports the optimum result by executing only twopasses of reading the input array sequentially. All these algorithms need only O(1) extra space. The solution of these problems also give a root 2 approximation for covering and hitting those line segments L by two congruent disks of minimum radius with same computational complexity. (C) 2018 Elsevier B.V. All rights reserved.
This paper discusses the problem of covering and hitting a set of line segments L in R-2 by a pair of axis-parallel squares such that the side length of the larger of the two squares is minimized. We also discuss the ...
详细信息
ISBN:
(纸本)9783319623894;9783319623887
This paper discusses the problem of covering and hitting a set of line segments L in R-2 by a pair of axis-parallel squares such that the side length of the larger of the two squares is minimized. We also discuss the restricted version of covering, where each line segment in L is to be covered completely by at least one square. The proposed algorithm for the covering problem reports the optimum result by executing only twopasses of reading the input data sequentially. The algorithm proposed for the hitting and restricted covering problems produces optimum result in O(n log n) time. All the proposed algorithms are in-place, and they use only O(1) extra space. The solution of these problems also give a root 2 approximation for covering and hitting those line segments L by two congruent disks of minimum radius with same computational complexity.
This paper proposes a novel static slicing technique for object-oriented programs which are generic in nature. Many algorithms have been proposed so far for object-oriented programs. There are also few algorithms whic...
详细信息
ISBN:
(纸本)9780769536545
This paper proposes a novel static slicing technique for object-oriented programs which are generic in nature. Many algorithms have been proposed so far for object-oriented programs. There are also few algorithms which describe slicing of inter-procedural object-oriented programs. But till date there is no algorithm proposed so far for slicing of object-oriented programs which are generic in nature. In this paper we describe an algorithm for slicing of inter-procedural generic program written in C++. But this technique can be applied to any programs which are generic in nature and written in any other languages like Ada, Eiffel, and J2SE etc.
暂无评论