원 집합의 계층적 포함관계 계산을 위한 O(nlogn) 알고리듬

초록

The problems of various research fields such as molecular modeling may be represented as circles with inclusion relations. Given n circles in the plane, the recognition of inclusion relations for a set of circles can be a tool to reason about geometric problems on 2D. In this paper, we introduce an O(nlogn) algorithm to find these relations for the circles and this algorithm make possible maintaining the geometric data hierarchy in the geometric data processing aspect.