DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yu, HJ | ko |
dc.contributor.author | Ra, Jong Beom | ko |
dc.date.accessioned | 2013-03-02T13:15:14Z | - |
dc.date.available | 2013-03-02T13:15:14Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1999 | - |
dc.identifier.citation | VISUAL COMPUTER, v.15, no.1, pp.9 - 20 | - |
dc.identifier.issn | 0178-2789 | - |
dc.identifier.uri | http://hdl.handle.net/10203/73678 | - |
dc.description.abstract | This paper proposes a new, fast, triangular mesh approximation method for the 3D visualization of surface data. Using spatio-frequency localization characteristics and directional information of wavelet coefficients, we determine local complexities of surface data and approximate the data to a proper triangular mesh. The proposed algorithm is quite simple, and the computational cost is low due to the direct use of wavelet coefficients for vertex removal. The computer simulation results for terrain data show that the proposed algorithm is excellent for fast 3D visualization. | - |
dc.language | English | - |
dc.publisher | SPRINGER VERLAG | - |
dc.subject | MULTIRESOLUTION | - |
dc.title | Fast triangular mesh approximation of surface data using wavelet coefficients | - |
dc.type | Article | - |
dc.identifier.wosid | 000079523100002 | - |
dc.identifier.scopusid | 2-s2.0-0032689819 | - |
dc.type.rims | ART | - |
dc.citation.volume | 15 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 9 | - |
dc.citation.endingpage | 20 | - |
dc.citation.publicationname | VISUAL COMPUTER | - |
dc.contributor.localauthor | Ra, Jong Beom | - |
dc.contributor.nonIdAuthor | Yu, HJ | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | 3D visualization | - |
dc.subject.keywordAuthor | triangular mesh approximation | - |
dc.subject.keywordAuthor | vertex removal | - |
dc.subject.keywordAuthor | wavelet transform | - |
dc.subject.keywordAuthor | terrain data | - |
dc.subject.keywordPlus | MULTIRESOLUTION | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.