Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
원 집합의 계층적 포함관계 계산을 위한 O(nlogn) 알고리듬
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | 김덕수 | - |
| dc.date.accessioned | 2021-08-04T06:24:18Z | - |
| dc.date.available | 2021-08-04T06:24:18Z | - |
| dc.date.issued | 2004-02-12 | - |
| dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/75307 | - |
| dc.description.abstract | 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. | - |
| dc.title | 원 집합의 계층적 포함관계 계산을 위한 O(nlogn) 알고리듬 | - |
| dc.type | Conference | - |
| dc.citation.conferenceName | 2004 한국 CAD/CAM 학회 학술발표회 | - |
| dc.citation.conferencePlace | 보광 휘닉스 컨벤션 센터 | - |
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - 서울 공과대학 > 서울 기계공학부 > 2. Conference Papers
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.