DC Field | Value | Language |
---|---|---|
dc.contributor.author | Baek, N | ko |
dc.contributor.author | Shin, Sung-Yong | ko |
dc.date.accessioned | 2013-02-27T13:05:20Z | - |
dc.date.available | 2013-02-27T13:05:20Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1998-05 | - |
dc.identifier.citation | INFORMATION PROCESSING LETTERS, v.66, no.3, pp.119 - 123 | - |
dc.identifier.issn | 0020-0190 | - |
dc.identifier.uri | http://hdl.handle.net/10203/68746 | - |
dc.description.abstract | Two points p and q are circularly-visible from each other, if there exists a circular are connecting p and q that does not intersect any obstacles. Circularly-hidden surface removal is to identify the circularly-visible portion of an environment, using the circular rays that are generated by rotating the points on a given half-plane about its bounding line. We first characterize the circularly-projected images of polygonal faces. Then, we show that circularly-hidden surface removal for polyhedral objects can be accomplished in O(n(2)alpha(n)) time, where n is the total number of edges of given polyhedrons. (C) 1998 Published by Elsevier Science B.V. All rights reserved. | - |
dc.language | English | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.title | On circularly-hidden surface removal | - |
dc.type | Article | - |
dc.identifier.wosid | 000074576300003 | - |
dc.identifier.scopusid | 2-s2.0-0042764653 | - |
dc.type.rims | ART | - |
dc.citation.volume | 66 | - |
dc.citation.issue | 3 | - |
dc.citation.beginningpage | 119 | - |
dc.citation.endingpage | 123 | - |
dc.citation.publicationname | INFORMATION PROCESSING LETTERS | - |
dc.contributor.localauthor | Shin, Sung-Yong | - |
dc.contributor.nonIdAuthor | Baek, N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | circularly-hidden surface removal | - |
dc.subject.keywordAuthor | circularly-visible | - |
dc.subject.keywordAuthor | hidden surface removal | - |
dc.subject.keywordAuthor | circular visibility | - |
dc.subject.keywordAuthor | algorithms | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.