Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/188
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Computing | - |
dc.creator | Yan, J | - |
dc.creator | Shi, P | - |
dc.creator | Zhang, DD | - |
dc.date.accessioned | 2014-12-11T08:27:13Z | - |
dc.date.available | 2014-12-11T08:27:13Z | - |
dc.identifier.issn | 1077-2626 | - |
dc.identifier.uri | http://hdl.handle.net/10397/188 | - |
dc.language.iso | en | en_US |
dc.publisher | Institute of Electrical and Electronics Engineers | en_US |
dc.rights | © 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. | en_US |
dc.rights | This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. | en_US |
dc.subject | Mesh simplification | en_US |
dc.subject | Object hierarchies | en_US |
dc.subject | Level of detail | en_US |
dc.subject | Shape approximation | en_US |
dc.title | Mesh simplification with hierarchical shape analysis and iterative edge contraction | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 142 | - |
dc.identifier.epage | 151 | - |
dc.identifier.volume | 10 | - |
dc.identifier.issue | 2 | - |
dc.identifier.doi | 10.1109/TVCG.2004.1260766 | - |
dcterms.abstract | This paper presents a novel mesh simplification algorithm. It decouples the simplification process into two phases: shape analysis and edge contraction. In the analysis phase, it imposes a hierarchical structure on a surface mesh by uniform hierarchical partitioning, marks the importance of each vertex in the hierarchical structure, and determines the affected regions of each vertex at the hierarchical levels. In the contraction phase, it also divides the simplification procedure into two steps: half-edge contraction and optimization. In the first step, memoryless quadric metric error and the importance of vertices in the hierarchical structure are combined to determine one operation of half-edge contraction. In the second step, it repositions the vertices in the half-edge simplified mesh by minimizing the multilevel synthesized quadric error on the corresponding affected regions from the immediately local to the more global. The experiments illustrate the competitive results. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | IEEE transactions on visualization and computer graphics, March/April 2004, v. 10, no. 2, p. 142-151 | - |
dcterms.isPartOf | IEEE transactions on visualization and computer graphics | - |
dcterms.issued | 2004-03 | - |
dc.identifier.isi | WOS:000188810600004 | - |
dc.identifier.scopus | 2-s2.0-1342345792 | - |
dc.identifier.eissn | 1941-0506 | - |
dc.identifier.rosgroupid | r16957 | - |
dc.description.ros | 2003-2004 > Academic research: refereed > Publication in refereed journal | - |
dc.description.oa | Version of Record | en_US |
dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Journal/Magazine Article |
Page views
150
Last Week
1
1
Last month
Citations as of May 19, 2024
Downloads
681
Citations as of May 19, 2024
SCOPUSTM
Citations
41
Last Week
0
0
Last month
0
0
Citations as of May 16, 2024
WEB OF SCIENCETM
Citations
23
Last Week
0
0
Last month
0
0
Citations as of May 16, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.