단순 다각형에서의 대각 가시성 문제에 대한 효율적인 알고리즘Efficient Algorithm for Solving Diagonal Visibility Problems in a Simple Polygon
- Publisher
- 한국정보과학회
- Issue Date
- 1993
- Language
- KOR
- Citation
한국정보과학회 1993년도 가을 학술발표, pp.1113 - 1116
- Appears in Collection
- CS-Conference Papers(학술회의논문)CS-Conference Papers(학술회의논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.