단순 다각형에서의 대각 가시성 문제에 대한 효율적인 알고리즘Efficient Algorithm for Solving Diagonal Visibility Problems in a Simple Polygon

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 403
  • Download : 0
DC FieldValueLanguage
dc.contributor.author김수환-
dc.contributor.author신성용-
dc.contributor.author좌경룡-
dc.date.accessioned2013-03-14T03:44:35Z-
dc.date.available2013-03-14T03:44:35Z-
dc.date.created2012-02-06-
dc.date.issued1993-
dc.identifier.citation한국정보과학회 1993년도 가을 학술발표, v., no., pp.1113 - 1116-
dc.identifier.urihttp://hdl.handle.net/10203/104929-
dc.languageKOR-
dc.publisher한국정보과학회-
dc.title단순 다각형에서의 대각 가시성 문제에 대한 효율적인 알고리즘-
dc.title.alternativeEfficient Algorithm for Solving Diagonal Visibility Problems in a Simple Polygon-
dc.typeConference-
dc.type.rimsCONF-
dc.citation.beginningpage1113-
dc.citation.endingpage1116-
dc.citation.publicationname한국정보과학회 1993년도 가을 학술발표-
dc.identifier.conferencecountrySouth Korea-
dc.identifier.conferencecountrySouth 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.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0