By Topic

Memory efficient adjacent triangle connectivity of a vertex using triangle strips

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
H. Annaka ; Multimedia Lab., Ricoh Co. Ltd., Japan ; T. Matsuoka

We often need to refer to adjacent elements (e.g., vertices, edges and triangles) in triangle meshes for rendering, mesh simplification and other processes. It is, however, sometimes impossible to prepare the enormous memory needed to represent element connectivity in gigantic triangle meshes. This paper proposes a new scheme for referring to adjacent triangles around a vertex in nonmanifold triangle meshes. First, we introduce the constraints to allow random access to a triangle in a sequence of triangle strips. Then, for each vertex, we construct a list of references to its adjacent strips as a representation of triangle connectivity. Experimental results show that, compared to conventional methods, our scheme can reduce the total size of a triangle mesh and adjacent triangle connectivity to about 50%

Published in:

Computer Graphics International, 2004. Proceedings

Date of Conference:

19-19 June 2004