Issue No. 04 - October-December (2003 vol. 9)
Junho Kim , IEEE Computer Society
Seungyong Lee , IEEE Computer Society
<p><b>Abstract</b>—This paper investigates the set of all selectively refined meshes that can be obtained from a progressive mesh. We call the set the <it>transitive mesh space</it> of a progressive mesh and present a theoretical analysis of the space. We define <it>selective</it> edge collapse and vertex split transformations, which we use to traverse all selectively refined meshes in the transitive mesh space. We propose a <it>complete</it> selective refinement scheme for a progressive mesh based on the transformations and compare the scheme with previous selective refinement schemes in both theoretical and experimental ways. In our comparison, we show that the complete scheme always generates selectively refined meshes with smaller numbers of vertices and faces than previous schemes for a given refinement criterion. The concept of dual pieces of the vertices in the vertex hierarchy plays a central role in the analysis of the transitive mesh space and the design of selective edge collapse and vertex split transformations.</p>
Progressive mesh, selective refinement, selectively refined mesh, transitive mesh space, hierarchical partitioning property, dual piece, valid vertex front.
J. Kim and S. Lee, "Transitive Mesh Space of a Progressive Mesh," in IEEE Transactions on Visualization & Computer Graphics, vol. 9, no. , pp. 463-480, 2003.