다각형 포함 트리를 구하는 효율적인 알고리즘 An Efficient Algorithm for Computing the Polygon Containment Tree

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 413
  • Download : 0
DC FieldValueLanguage
dc.contributor.author김수환-
dc.contributor.author신성용-
dc.contributor.author좌경룡-
dc.date.accessioned2013-03-15T00:17:47Z-
dc.date.available2013-03-15T00:17:47Z-
dc.date.created2012-02-06-
dc.date.issued1994-
dc.identifier.citation한국정보과학회 1994년도 가을 학술발표, v.21, no.2, pp.651 - 654-
dc.identifier.urihttp://hdl.handle.net/10203/114926-
dc.languageKOR-
dc.publisher한국정보과학회-
dc.title다각형 포함 트리를 구하는 효율적인 알고리즘-
dc.title.alternativeAn Efficient Algorithm for Computing the Polygon Containment Tree-
dc.typeConference-
dc.type.rimsCONF-
dc.citation.volume21-
dc.citation.issue2-
dc.citation.beginningpage651-
dc.citation.endingpage654-
dc.citation.publicationname한국정보과학회 1994년도 가을 학술발표-
dc.identifier.conferencecountrySouth Korea-
dc.identifier.conferencecountrySouth Korea-
dc.contributor.localauthor신성용-
dc.contributor.nonIdAuthor김수환-
dc.contributor.nonIdAuthor좌경룡-
Appears in Collection
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