PolyU Institutional Repository >
COMP Journal/Magazine Articles >
Please use this identifier to cite or link to this item:
|Title: ||Mesh simplification with hierarchical shape analysis and iterative edge contraction|
|Authors: ||Yan, Jingqi|
Zhang, David D.
|Subjects: ||Mesh simplification|
Level of detail
|Issue Date: ||Mar-2004 |
|Publisher: ||IEEE Computer Society|
|Citation: ||IEEE Transactions on visualization and computer graphics, March/April 2004, v. 10, no. 2, p. 142-151.|
|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.|
|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.|
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.
|Type: ||Journal/Magazine Article|
|Appears in Collections:||COMP Journal/Magazine Articles|
All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
No item in the PolyU IR may be reproduced for commercial or resale purposes.