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 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.

Abstract
 1. 서 론
 2. 알고리듬 소개
  2.1 원들의 x값으로의 정렬
  2.2 Plane sweep method
  2.3 구간트리
 3. 원들의 계층적 표현
 4. 결론 및 향후 연구과제
 참고문헌

• 이병훈(한양대학교 산업공학과)
• 조영송(Voronoi diagram 연구단)
• 김동욱(한양대학교 산업공학과)
• 김덕수(한양대학교 산업공학과)