Issue No. 04 - July/August (2006 vol. 12)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TVCG.2006.59
<p><b>Abstract</b>—Modern graphics cards are equipped with a vertex cache to reduce the amount of data needing to be transmitted to the graphics pipeline during rendering. To make effective use of the cache and facilitate rendering, it is key to represent a mesh in a manner that maximizes the cache hit rate. In this work, we propose a simple yet effective algorithm for generating a sequence for efficient rendering of 3D polygonal meshes based on greedy optimization. The algorithm outperforms the current state-of-the-art algorithms in terms of rendering efficiency of the resultant sequence. We also adapt it for the rendering of progressive meshes. For any simplified version of the original mesh, the rendering sequence is generated by adaptively updating the reordered sequence at full resolution. The resultant rendering sequence is cheap to compute and has reasonably good rendering performance, which is desirable to many complex rendering environments involving continuous rendering of meshes at various level of details. The experimental results on a collection of 3D meshes are provided. </p>
Polygon mesh, rendering sequence, vertex cache, progressive mesh, efficient rendering.
T. P. Yu and G. Lin, "An Improved Vertex Caching Scheme for 3D Mesh Rendering," in IEEE Transactions on Visualization & Computer Graphics, vol. 12, no. , pp. 640-648, 2006.