Anda di halaman 1dari 64

# Triangle Surfaces with Discrete Equivalence Classes

Introduction

Introduction

Introduction

Introduction

Introduction

## Schiftner et al. [2009]

Economy
Paneling Architectural Freeform Surfaces Michael Eigensatz, Martin Kilian, Alexander Schiftner, Niloy J. Mitra, Helmut Pottmann and Mark Pauly

Motivation

## Equivalent Set Surface

576 triangles | 6 unique triangle

Patterns 2D
Planar patterns generated by Craig Kaplan [2004]

Patterns 3D
Quad parameterization of planar patterns [2009]

Mosaic 2D

Mosaic 3D

Original

Optimized

## Discrete Equivalence Classes

Input Shape Clustering
Polygon Assignment & Canonical Triangles Modified Geometry

Rigid Transformation
Mesh of Canonical Triangles

Example

## 5-Point Tensile Roof 1280 triangles

Canonical Triangle
Pi

Cind (i )

C j ,ind

min D( Pi , Cind (i ) )
i

Triangle Similarity
a3 b3 b2

D( A, B )

a1

a2

b1

D( A, B) = Tmin

R R = I ,T , j

| Rb perm ( j ,l ) + T al |2
l =1

Transform B

Triangle Similarity
a3 b3 b2
(b1, b2, b3), (b2, b3, b1), (b3, b1, b2), (b1, b3, b2), (b3, b2, b1), (b2, b1, b3)

D( A, B )

a1

## (a1, a2, a3)

a2

b1

D(A,B) = Tmin

R R =I ,T , j

| Rb
l =1

+ T al |2 perm( j,l )

Canonical Triangle
(x3,y3,0)

Cind (i )

## C j ,1 = (0,0,0) C j , 2 = ( x2 ,0,0) C j ,3 = ( x3 , y3 ,0)

(0,0,0)

(x2,0,0)

Nonlinear Minimization

C j ,ind

min D( Pi , Cind (i ) )
i

Canonical Triangle
Pi

Cind (i )

R R = I ,T , j

min T

| RC
l =1

+ T Pl |2 perm ( j ,l )

Rigid Transformation

## Process continues to generate more clusters

Clustering
Polygon Assignment Canonical Polygons Nonlinear Optimization Generate Clusters

Clustering
1

Error

C j ,ind

min D( Pi , Cind (i ) )
i

5 10 Number of Clusters 20

Clustering

R R = I ,T , j

min T

| RC perm ( j ,l ) + T Pl |2
l =1

Clustering

1 5

10

20

20 clusters

## Before Global Optimization

Disconnected Triangles

## Poisson Optimization - Yu et al. [2004]

Global Optimization
Poisson Optimization

Re-Cluster

## Deform Original Mesh

Global Optimization

min ( E g + Ec + Eb )
P

## Proximity and Fairness

Rigid Transformation Global Non-Linear Optimization
R R = I ,T , j

min T

| RC perm ( j ,l ) + T Pl |2
l =1

1 - Cluster

2 - Clusters

3 - Clusters

4 - Clusters

5 - Clusters

6 - Clusters

1 5

10

20

1 5

10

20

Example

## 2492 triangles | 64 clusters = 2.56% of total triangles

Roof
1.722%

Torus Knot
2.014%

Venus
6.017%

Bunny
2.436%

4-point roof

0.313%

5-point roof
0.781%

Comparison
K-set Tilable Surfaces Ours

Non planar Quadrilaterals 8 permutations for best rigid transformation Mean S-quad, compute once Global non-linear optimization Begin with large # of clusters & merge

Planar Triangle 6 permutations for best rigid transformation Non linear search for canonical, iterative Global linear optimization Begin with small # of clusters & add more

Future Work
Detect outliers in clusters n-gons
Planarity

Modify topology
Symmetry?

Maintain streamlines
Non-existent?

## Paneling Arch. Freeform Surfaces

Use small # of molds, with associated cost Create non-congruent panels from the mold Emphasis upon streamlines Minimize divergence and kink angle

Clustering

## Rotation of Canonical Triangle

50% rotation

100% rotation

Comparative Analysis
Paneling Architectural Freeform Surfaces Use of small # of molds Each mold has an associated cost Emphasis upon streamlines Divergence and Kink angle K-set Tilable Surfaces Triangle Surfaces with Discrete Equivalence Classes Planar Triangles 6 permutations for rigid transformation Global linear optimization Begin with 1 cluster, add more Non linear search for canonical triangles, updated for each iteration