단순 다각형의 최단 가시 체인을 찾는 알고리즘An algorithm for finding the minimum visible chain of a simple polygon

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 461
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisor좌경룡-
dc.contributor.advisorChwa, Kyung-Yong-
dc.contributor.author우영철-
dc.contributor.authorWu, Young-Chul-
dc.date.accessioned2011-12-13T05:53:19Z-
dc.date.available2011-12-13T05:53:19Z-
dc.date.issued1990-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=67274&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/33891-
dc.description학위논문(석사) - 한국과학기술원 : 전산학과, 1990.2, [ [ii], 33, [7] p. ]-
dc.languagekor-
dc.publisher한국과학기술원-
dc.title단순 다각형의 최단 가시 체인을 찾는 알고리즘-
dc.title.alternativeAn algorithm for finding the minimum visible chain of a simple polygon-
dc.typeThesis(Master)-
dc.identifier.CNRN67274/325007-
dc.description.department한국과학기술원 : 전산학과, -
dc.identifier.uid000871254-
dc.contributor.localauthor좌경룡-
dc.contributor.localauthorChwa, Kyung-Yong-
Appears in Collection
CS-Theses_Master(석사논문)
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