Diagonal_Matrix and Subdivision

Nam-Woo Kim

Computer Graphics LabGraduate School of Software

d5302010@dongseo.ac.kr

November. 3. 2004

Our Goal

Relation of Mesh and Matrix

0

BBBBBBBBB@

0:1;0:2;0:3;0:4;0:5;0:6;0:1;0:2: : :0:5;0:6;0:7;0:8;0:9;1:0;0:7;0:8: : :0:0;0:6;0:7;0:8;0:7;0:3;0:8;0:7: : :0:0;0:0;0:1;1:2;0:5;1:1;0:1;1:2: : :0:0;0:0;0:0;1:6;1:1;2:3;1:6;1:1: : :0:0;0:0;0:0;0:0;1:1;0:5;0:3;0:2: : :

............

1

CCCCCCCCCA

0

BBBBBB@

0:1;0:0;0:0;0:00:5;0:6;0:0;0:00:5;0:6;0:7;0:00:0;1:0;0:1;1:20:0;0:0;1:5;1:60:0;0:0;0:0;2:0

1

CCCCCCA

Mesh 가 많으면 Error 가 작으나 , Matrix 가 커진다 .

Devide diagonal_matrix

How grant the Index

Best Diagonal_Matrix

• 기본조건

order 의 값이 가장 큰 vertex 의 폭을 벗어나서는 않된다 .

모든 vertex 들의 order 도 최대폭 내에 존재하여야 한다 .

Impossibility(Ⅰ)

Impossibility(Ⅱ)

Subdivision

Subdivision schemes

mask = w; 12

+ w; 12

+ w;¡ w

Butterfly schemes

Butterfly schemes

Problem