Non-Replicating Indexing for Out-Of-Core Processing of Semi-Regular Triangular Surface Meshes
Proceedings, 13th International Meshing Roundtable, Williamsburg, VA, Sandia National Laboratories, SAND #2004-3765C, pp.39-46, September 19-22 2004
13th International Meshing Roundtable
Willimasburg, Virginia, USA
September 19-22, 2004
University of Michigan, Ann Arbor
We introduce an indexing scheme for the vertices of semi-regular meshes, based on interleaving quadtrees rooted on the edges of the
base mesh. Using this indexing scheme we develop an out-of-core data structure for semi-regular mesh processing. Our approach
targets applications that process vertex data in a coarse-to-fine manner performing several passes through each level of the hierarchy.
We consider several measures of layout quality that provide lower bounds on the size of in-core memory buffer required for valid
referencing of vertex data during an atomic step of mesh processing. The approach is tested on an in-place implementation of the
Loop subdivision scheme for large control meshes.
Download Full Paper (PDF Format)
Contact author(s) or publisher for availability and copyright information on above referenced article