Because of their improved numerical properties, quadrilateral meshes have become a popular representation for finite elements computations and computer animation. In this paper we address
the problem of optimally representing quadrilateral meshes as generalized triangle strips (with one swap bit per triangle). This is important because 3D rendering hardware is optimized for render-ing
triangle meshes transmitted from the CPU to the GPU in the form of triangle strips. We describe simple linear time and space constructive algorithms, where each quadrilateral face is split along one of its two diagonals and the resulting triangles are linked along the original mesh edges. We show that with these algorithms evrery connected manifold quadrilateral mesh without boundary can be optimally represented as a single Hamiltonian generalized triangle strip cycle in multiple ways, and we discuss simple strategies to tailor the construction for transparent vertex caching.
By: Gabriel Taubin
Published in: RC22295 in 2001
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .