On the Fixed - Size Polygon Placement Problem
이상호, 도정인, 좌경룡 · 1985
In this paper, we consider the fixed-size polygon placement problem: Given a set of n points and a simple polygon p in the plane, tine a placement of P so that the number of points covered by P is maximized. To solve this, we simply transrorm it into the maximum stapbing point problem which may be considered as the dual of it. Also, we give the data structure and algorithm with O((n+k) logn) time and O(n) space for this dual problem, where k is the number of intersection points.