Mesh Basics

More documents

Recommendations

Info

The Winged-Edge Data Structure: 6/6 The winged-edge d data structure seems to be very “unstructured;” however, it does record the incidence relations in a clever way. This clever way permits a program to answer many topological inquires very efficiently. If (1) V, E and F are the numbers of vertices, edges, and faces and (2) each entry in the table uses one memory unit, the vertex table, edge table, and face table require V, 8E and F memory units, respectively. 34
Inquiry Example 1: 1/4 Find all incident edges of a given vertex X. Find one incident edge of X from its vertex table entry. Then, find the next incident edge, and “loop around” to find other incident edges. get this one from vertex table X find next find next 35
Page 1 and 2: Mesh Basics Spring 2010 1
Page 3 and 4: Definitions: 2/2 A mesh is a manif
Page 5 and 6: Manifolds with/without Boundary If
Page 7 and 8: Non-Orientable Manifolds: 2/2 The K
Page 9 and 10: Mesh Examples: 2/2 Vertices: 703 Ed
Page 11 and 12: Euler-Poincaré Characteristic: 2/5
Page 13 and 14: Euler-Poincaré Characteristic: 4/5
Page 15 and 16: Homeomorphisms: 1/3 Two 2-manifold
Page 17 and 18: Homeomorphisms: 3/3 Hence, any orie
Page 19 and 20: Applications: 2/3 Only a torus can
Page 21 and 22: Data Structures for Meshes Since me
Page 23 and 24: What Is a Winged-Edge? 2/7 If all f
Page 25 and 26: What Is a Winged-Edge? 4/7 If all f
Page 27 and 28: What Is a Winged-Edge? 6/7 Start Ve
Page 29 and 30: The Winged-Edge Data Structure: 1/6
Page 31 and 32: The Winged-Edge Data Structure: 3/6
Page 33: The Winged-Edge Data Structure: 5/6
Page 37 and 38: Inquiry Example 1: 3/4 Here is a po
Page 39 and 40: Inquiry Example 2: 1/4 Find all edg
Page 41 and 42: Inquiry Example 2: 3/4 Since the me
Page 43 and 44: Discussions Both examples list elem
Page 45: The End 45

Mesh Basics

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?