• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.627-629
• /
• 2017

There are a lot of research results on the problem of finding the union and intersection of n rectangles on a plane. Lipski와 Preparata(1981) presented a sequential algorithm with O(nlogn) time and O(nlogn) space for the problem of finding the union of rectangles whose sides are parallel to the coordinate axes[1]. Alevizos(2013) presented an improved O(nlogn) time and O(n) space algorithm for the same problem[2]. In this paper, we consider the problem of finding the union of iso-oriented rectangles such that the intersection of them is not an empty set. In this case, the union of the rectangles becomes a connected area, that is, an orthogonal polygon. In this paper, we propose a parallel algorithm that solves this problem in constant time in a reconfigurable mesh(in short, RMESH) model.