단순다각형의 최단 외부가시선분을 구하는 최적 알고리즘An Optimal Algorithm for Finding the Shortest External Visible Line Segments of a Simple Polygon
- Publisher
- 한국정보과학회
- Issue Date
- 1991
- Language
- KOR
- Citation
Proc. KISS Annual Conference, v.18, no.1, pp.491 - 494
- 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.