Single Triangle Strip and Loop on Manifolds with Boundaries

1

• Single Triangle Strip and Loop on Manifolds with
  Boundaries
• Pablo Díaz-Gutiérrez, David Eppstein and M. Gopi
• University of California, Irvine

2
Introduction

• Dual graph of a triangle mesh is 3-regular
• Unless it's got boundaries
• Perfect matching in a 3-regular graph produces a
  2-factor
• Boundaries may make matching impossible

3
Applications (I)

• Hierarchyless simplification

4
Applications (II)

• Hand and glove topology compression

1
0
1
0
1
0
1
0
Encoding of a strip as a zipping of two trees
5
Applications (III)

• High performance interactive rendering

High-locality single-strip
6
Single-strips through matching
7
Single-strips through matching
8
Single-strips through matching
9
Single-strips through matching
10
Single-strips through matching
11
Single-strips through matching
12
Single-strips through matching
13
Outline

• Introduction
• Forced loop method
• Split tie method
• Linear single strips

14
Forced loop method
I
I
I
I
15
Forced loop method
16
Forced loop method
17
Forced loop method
18
Split tie method Example
19
Outline

• Introduction
• Forced loop method
• Split tie method
• Linear single strips

20
Split tie method
C
C
e6
e6
e0
e0
B
B
A
A
e5
e5
e4
e4
e1
e1
e3
e3
e2
e2
21
Outline

• Introduction
• Forced loop method
• Split tie method
• Linear single strips

22
Linear single strips
23
Linear single strip Example