단순다각형의 최단 외부가시선분을 구하는 최적 알고리즘An Optimal Algorithm for Finding the Shortest External Visible Line Segments of a Simple Polygon
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | 이승용 | - |
| dc.contributor.author | 좌경룡 | - |
| dc.contributor.author | 신성용 | - |
| dc.date.accessioned | 2013-03-14T04:34:38Z | - |
| dc.date.available | 2013-03-14T04:34:38Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 1991 | - |
| dc.identifier.citation | Proc. KISS Annual Conference, v.18, no.1, pp.491 - 494 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/105303 | - |
| dc.language | KOR | - |
| dc.publisher | 한국정보과학회 | - |
| dc.title | 단순다각형의 최단 외부가시선분을 구하는 최적 알고리즘 | - |
| dc.title.alternative | An Optimal Algorithm for Finding the Shortest External Visible Line Segments of a Simple Polygon | - |
| dc.type | Conference | - |
| dc.type.rims | CONF | - |
| dc.citation.volume | 18 | - |
| dc.citation.issue | 1 | - |
| dc.citation.beginningpage | 491 | - |
| dc.citation.endingpage | 494 | - |
| dc.citation.publicationname | Proc. KISS Annual Conference | - |
| dc.identifier.conferencecountry | South Korea | - |
| dc.identifier.conferencecountry | South Korea | - |
| dc.contributor.localauthor | 좌경룡 | - |
| dc.contributor.localauthor | 신성용 | - |
| dc.contributor.nonIdAuthor | 이승용 | - |
- 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.