Mesh Basics

Spring 2010

Definitions: 1/2
A polygonal mesh consists of three kinds of mesh elements: vertices, edges, and faces. The information describing the mesh elements are mesh connectivity and mesh geometry. y g y The mesh connectivity, or topology, describes the incidence relations among mesh elements (e.g., adjacent vertices and edges of a face, etc). The mesh geometry specifies the position and other geometric characteristics of each vertex.
2

Definitions: 2/2

closed fan

A mesh is a manifold if (1) each edge is incident to only one or two faces and (2) the faces incident to a vertex form a closed or an open fan. The orientation of a face is a cyclic open fan order of the incident vertices. The orientation of two adjacent faces is compatible, if the two vertices of the common edge are in opposite order. A manifold mesh is orientable if any y two adjacent faces have compatible orientation.
3

Non-Manifold Non Manifold Meshes

Manifold Conditions: (1) Each edge is incident to only one or two faces and (2) the faces incident to a vertex form a closed or an open fan. g p The following examples are not manifold meshes!

Manifolds with/without Boundary

If every vertex has a closed fan, the given manifold has no boundary. Edges only incident to one face form the boundary of the manifold. y p polygons. Boundary is a union of simple p yg We only consider orientable manifolds without boundary in this course. t out bou da y t s cou se
closed fan
manifold boundary

open fan

boundary

non-manifold boundary

Non-Orientable Non Orientable Manifolds: 1/2

Not all manifolds are orientable. The most wellknown ones are Mbius band and Klein bottle. The Mbius band is shown below, and is an onesided manifold with boundary (i.e., a circle). y

http://www.jcu.edu/math/vignettes/Mobius.htm

Non-Orientable Non Orientable Manifolds: 2/2

The Klein bottle is a manifold without boundary. g p p y yields two Mbius Slicing a Klein bottle properly y bands.
A Klein bottle sliced to show its interior interior. However, Klein bottles have no interior.

Maurice Frchet and Ky Fan, Invitation to Combinatorial Topology p gy

Tin-Tin Yu, MTU

Mesh Examples: 1/2

Vertices: 4,634 Edges: 13,872 Faces:9,248

Mesh Examples: 2/2

Vertices: 703 Edges: 2106 Faces: 1401

9

Euler-Poincar Euler Poincar Characteristic: 1/5

Given a 2-manifold mesh M without boundary, the Euler-Poincar characteristic of M is (M) = V-E+F, where V, E and F are the number of vertices, number of edges, and number of faces.

V=8, E=12 V=8 E=12, F=6 (M) =V-E+F=2

V=16, E=32 V=16 E=32, F=16 (M) =V-E+F=0

V=28, E=56 V=28 E=56, F=26 (M) =V-E+F=-2

10

Euler-Poincar Euler Poincar Characteristic: 2/5

Euler-Poincar characteristic (M) = V-E+F is independent of tessellation.
V=24, E=48, F=22 (M) =V-E+F=-2

V 16, E=32, F=16 V=16, E 32, F 16 (M) =V-E+F=0

V 16, E=36 F=20 V=16 E 36, F 20 (M) =V-E+F=0

V 28, E=56, F=26 V=28, E 56, F 26 (M) =V-E+F=-2

11

Euler-Poincar Euler Poincar Characteristic: 3/5

An orientable 2-manifold mesh M with g handles (i.e., genus) has Euler-Poincar characteristic (M) = V-E+F = 2(1-g). Spheres, boxes, tetrahedrons and convex p surfaces have g = 0; but, tori have g = 1.

g=0 (M) =2(1-0)=2

g=1 (M) =2(1-1)=0

g=2 (M) =2(1-2)=-2

12

Euler-Poincar Euler Poincar Characteristic: 4/5

The boundary of an orientable 2-manifold is the union of a set of simple polygons. Since each polygon bounds a face, these boundary faces may be added back to form a y y manifold without boundary so that EulerPoincar characteristic can be applied. The Euler-Poincar characteristic of an o e be orientable 2-manifold w bou d y is (M) = o d with boundary s ( ) 2(1-g)-, where is the number boundary po ygo s . polygons.
13

Euler-Poincar Euler Poincar Characteristic: 5/5

Two Examples:

V = 10, E = 15, F = 6 g = 0, = 1 (M) = V-E+F = 1 (M) = 2(1-g)- = 1

V = 30, E = 54, F = 20 g = 2, = 2 (M) = V-E+F = -4 (M) = 2(1-g)- = -4

14

Homeomorphisms: 1/3
Two 2-manifold meshes A and B are homeomorphic if their surfaces can be transformed to the other by twisting, squeezing, and stretching without cutting and gluing. Thus, boxes, spheres and ellipsoids are homeomorphic to each other.

is homeomorphic to

15

Homeomorphisms: 2/3
Two orientable 2-manifold meshes without boundary are homeomorphic if and only if they have the same Euler-Poincar characteristic. g Thus, a m-handle (i.e., genus m) orientable mesh is homeomorphic to a n-handle (i.e., genus n) orientable mesh if and only if m = n. Two orientable 2-manifold meshes with the same number of boundary polygons are homeomorphic if and only if they have the same Euler-Poincar characteristic. u e o ca c a acte st c.
16

Homeomorphisms: 3/3
Hence, any orientable 2-manifold mesh without boundary is homeomorphic to a sphere with m handles (i.e., genus m), where m 0.

17

Applications: 1/3
A mesh is regular if all faces have the same number edges, and all vertices are incident to the same number of edges (i.e., valence). g q Each face of a regular quad mesh is a quadrilateral (i.e., four-sided) and each vertex is incident to four edges (i.e., valence = 4).

18

Applications: 2/3
Only a torus can be a regular quad mesh! g g Since each vertex has 4 edges and each edge is counted twice, we have 4V = 2E (i.e., V=E/2). Since each face has 4 edges and each edge is counted twice, we have 4F = 2E (i.e., F = E/2). Thus, Thus (M) = V-E+F = 0 means a torus!

19

Applications: 3/3
Only tori can be regular triangle mesh of valence 6! g Since each vertex has 6 edges and each is counted twice, we have 6V = 2E (i.e., V=E/3). Since each face has 3 edges and each edge is counted twice, we have 3F = 2E (i.e., F = 2E/3). Thus, Thus (M) = V-E+F = 0 means a torus!

20

Data Structures for Meshes

Since meshes are usually large and complex and since many operations are performed on meshes, compact data structures that support efficient algorithms are needed. Depending on the applications in hand, one may use vertex- (or point-) based, edge-based, face-based, or other data structures. One of the earliest edge based data structure is edge-based the winged-edge data structure. Its new variant is t e half-edge data st uctu e. s the half edge structure.
21

What Is a Winged Edge? 1/7 Winged-Edge?

If all faces are oriented clock-wise, each edge has eight pieces of incident information.
a d Given edge: b=XY g Incident faces: 1 and 2 Pred. & succ. edges of 1 Pred. & succ. edges of 2 P d d f 2 e X The wings of edge b=XY are faces 1 and 2. Edge b is a winged-edge g g g
22

1 c

What Is a Winged Edge? 2/7 Winged-Edge?

If all faces are oriented clock-wise, each edge has eight pieces of incident information.
The first four pieces: f p The two vertices of b: X and Y The Th two i id incident faces: f 1 and 2

23

What Is a Winged Edge? 3/7 Winged-Edge?

If all faces are oriented clock-wise, each edge has eight pieces of incident information.
a The pred. and succ. edges p g of b with respect to face 1: a and c

1 c

24

What Is a Winged Edge? 4/7 Winged-Edge?

If all faces are oriented clock-wise, each edge has eight pieces of incident information.
d The pred. and succ. edges p g of b with respect to face 2: e and d 2 e X
25

What Is a Winged Edge? 5/7 Winged-Edge?

How do we name faces 1 and 2? We use left and right faces!
a Y d Which one is left, 1 or 2? , Choose a direction for edge b, say from X to Y or from Y to X X. Going from the start vertex to the end vertex, we know vertex which face is the left one! If the start vertex is X, the , left face is face 1. 26

1 c

2 e

What Is a Winged Edge? 6/7 Winged-Edge?

Information for Edge b (from X to Y) o o o dge ( o o )
Start Vertex X End Vertex Y Left Face 1 Right Face 2 Left Pred. a Left Succ. c Right Pred. e Right Succ. d

1 c

2 e

27

What Is a Winged Edge? 7/7 Winged-Edge?

Information for Edge b (from Y to X) o o o dge ( o o )
Start Vertex Y End Vertex X Left Face 2 Right Face 1 Left Pred. e Left Succ. d Right Pred. a Right Succ. c

1 c X

2 e
28

The Winged Edge Data Structure: 1/6 Winged-Edge

The winged-edge data structure has three tables, edge table, vertex table, and face table. Each edge has one row in the edge table. Each row contains the eight pieces information of that g p edge. Each vertex has one entry in the vertex table. Each entry has a pointer to an incident edge (in the edge table) of that vertex. Each face has one entry in the face table. Each entry has a pointer to an incident edge (in the 29 edge table) of that face.

The Winged Edge Data Structure: 2/6 Winged-Edge

The vertex table entry for vertex X may be the edge table entry of edges c, b, e, or any other incident edge.
a Y d

1 c

2 e

30

The Winged Edge Data Structure: 3/6 Winged-Edge

The face table entry for face 1 may be the edge table entry of edges a, b, c, or any other incident edge.
a Y d

1 c

2 e

31

The Winged Edge Data Structure: 4/6 Winged-Edge

The following tetrahedron has four vertices A, B, C and D, six edges a, b, c, d, e, f, and four faces 1, 2, 3 and 4.
face 3: ACD face 4: ABC

Vertex Table Vertex A Edge a b d a Face Table Face 1 2 3 4 Edge a c a b

32

a A b B 1 f c 2

e C d

B C D

The Winged Edge Data Structure: 5/6 Winged-Edge

face 3: ACD face 4: ABC

a A
L. Pred e c a e c d L. Succ f a b c d b R. Pred b f d b f a R. Succ c d e f a e

e 1 f b B c 2 C d

Edge Table
Edge Start Vtx a b c d e f A A B B C A End Vtx D B D C D C L. Face 3 1 1 2 2 4 R. Face 1 4 2 4 3 3

33

The Winged Edge Data Structure: 6/6 Winged-Edge

The i Th winged-edge d d d data structure seems to b be very unstructured; however, it does record the incidence relations in a clever way. way This clever way permits a program to answer many topological inquires very efficiently efficiently. If (1) V, E and F are the numbers of vertices, edges, 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. y Then, find the next incident edge, and loop around around to find other incident edges.

get this one from vertex table

X
find fi d next t find next
35

Inquiry Example 1: 2/4

How do we find the next edge from the current one? Let us use the counter clock-wise order. We have two cases to consider:

next = left l ft succ

next = i ht right succ

36

current

current

Inquiry Example 1: 3/4

Here is a possible algorithm:
Given vertex X; Gi Retrieve an incident edge e of X from vertex table; Let s be e; // working variable do // move to next edge p ; // found one incident edge g Output s; if start vertex of s is equal to X then s = the successor of the left face of s else l s = the successor of the right face of s; end if while s e; // loop back if not equal

37

Inquiry Example 1: 4/4

This l i h fi d ll i id Thi algorithm finds all incident edges of a d f vertex by scanning those edges in the neighborhood of the given vertex In fact this vertex. fact, algorithm scans exactly the incident edges. Since the number of incident edges of a vertex is usually small for most vertices, this algorithm is fast and of (almost) constant complexity! Compared with a conventional data structure, the winged-edge data structure wins handsdown in this case.
38

Inquiry Example 2: 1/4

Find all edges (and vertices, of course) of a given face f Find one edge of f from its face table entry. Then, find the next incident edge, and move move forward edge by edge to find all other edges. Keep in mind that the vertices of each face is oriented clock-wise.

39

Inquiry Example 2: 2/4

Suppose we wish to list the edges in counter clock-wise order. The given face should always be on the left hand side of each edge. g

counter clock-wise

40

Inquiry Example 2: 3/4

Since the meaning of left and right face of an edge is based on that edges orientation, we have to find the true meaning of to the left of an edge when traversing.

right face of current edge use right predecessor

left face of current edge use left predecessor

41

Inquiry Example 2: 4/4

Here is a possible algorithm:
Given face f; Retrieve an incident edge e of f from face table; Let be L t s b e; // working variable ki i bl do // move to next edge Output s; // found one incident edge if f is the left face of s then s = the predecessor of the left face of s else s = the predecessor of the right face of s; end if while s e; // loop back if not equal 42

Discussions
Both examples list elements in counter clockwise order. It is easy to change to clock-wise. The second example obviously requires more p processing than a conventional data structure g does; however, the first one is much faster. Based on what you know, do this inquiry:
Given a vertex X find X, all outer edges of X (i.e., the link) in counter clock-wise order clock wise order.
43

Exercise
The half-edge data structure is an extension to the winged-edge data structure, and is more popular and widely used today. p g It splits each edge into two, each of which is referred to as an half-edge. Search the web to learn more about this data structure. An open source software OpenMesh software, OpenMesh, developed by Prof. Leif Kobbelt, is available here: www openmesh org www.openmesh.org
44

The End

45