DSpace at KOASAS
College of Engineering(공과대학)School of Computing(전산학부)CS-Journal Papers(저널논문)

AN OPTIMAL ALGORITHM FOR FINDING THE EDGE VISIBILITY POLYGON UNDER LIMITED VISIBILITY

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 374
  • Download : 0
Export
DC FieldValueLanguage
dc.contributor.authorKIM, SHko
dc.contributor.authorPARK, JHko
dc.contributor.authorCHOI, SHko
dc.contributor.authorShin, Sung-Yongko
dc.contributor.authorChwa, Kyung Yongko
dc.date.accessioned2013-03-03T03:16:16Z-
dc.date.available2013-03-03T03:16:16Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued1995-03-
dc.identifier.citationINFORMATION PROCESSING LETTERS, v.53, no.6, pp.359 - 365-
dc.identifier.issn0020-0190-
dc.identifier.urihttp://hdl.handle.net/10203/76947-
dc.description.abstractTwo points in a polygon P are said to be d-visible if the line segment l joining them is contained in P and the length of l is d or less. In applications such as computer graphics and robot vision, the notion of d-visibility is more suitable than the commonly used definition of visibility, which is equivalent to d-visibility with infinite d. We present an O(n) time algorithm for finding the d-visibility polygon from an edge e in P, where n is the number of vertices in P.-
dc.languageEnglish-
dc.publisherELSEVIER SCIENCE BV-
dc.subjectLINEAR-TIME-
dc.titleAN OPTIMAL ALGORITHM FOR FINDING THE EDGE VISIBILITY POLYGON UNDER LIMITED VISIBILITY-
dc.typeArticle-
dc.identifier.wosidA1995QN72600011-
dc.identifier.scopusid2-s2.0-0347069383-
dc.type.rimsART-
dc.citation.volume53-
dc.citation.issue6-
dc.citation.beginningpage359-
dc.citation.endingpage365-
dc.citation.publicationnameINFORMATION PROCESSING LETTERS-
dc.contributor.localauthorShin, Sung-Yong-
dc.contributor.localauthorChwa, Kyung Yong-
dc.contributor.nonIdAuthorKIM, SH-
dc.contributor.nonIdAuthorPARK, JH-
dc.contributor.nonIdAuthorCHOI, SH-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorCOMPUTATIONAL GEOMETRY-
dc.subject.keywordAuthorVISIBILITY-
dc.subject.keywordPlusLINEAR-TIME-
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

Display Simple Item Record

qr_code

  • mendeley

    citeulike

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


rss_1.0 rss_2.0 atom_1.0