r t ss - - PowerPoint PPT Presentation

r t s s
SMART_READER_LITE
LIVE PREVIEW

r t ss - - PowerPoint PPT Presentation

rtt rst r t ss st Ptrtr


slide-1
SLIDE 1

❈❙ ❉❡♣❛rt♠❡♥t✱ ❘✐❝❡ ❯♥✐✈❡rs✐t②

❉❡ ❇♦♦r ❙✉✐t❛❜❧❡ ❚✲s♣❧✐♥❡s

❨❛♥❣ ❩❤❛♥❣ ❱✐s✐t P❛t❛r❛♥✉t❛♣♦r♥ ❘♦♥ ●♦❧❞♠❛♥

▼❛② ✷✶✱ ✷✵✶✼

slide-2
SLIDE 2

1

De Boor Suitable T-Splines

Goal: to develop a de Boor evaluation algorithm for T-spline surfaces.

Yang Zhang | T-spline - De Boor Algorithm

slide-3
SLIDE 3

2

De Boor Suitable T-Splines

De Boor Algorithm Review

Yang Zhang | T-spline - De Boor Algorithm

slide-4
SLIDE 4

3

De Boor Suitable T-Splines

De Boor Algorithm Review

Yang Zhang | T-spline - De Boor Algorithm

slide-5
SLIDE 5

4

De Boor Suitable T-Splines

A few assumptions

◮ We talk only about Bidegree (3, 3). ◮ T-junctions only, NO L-junctions and NO I-junctions.

Yang Zhang | T-spline - De Boor Algorithm

slide-6
SLIDE 6

5

De Boor Suitable T-Splines

Admissible T-meshes

Admissible T-meshes

Yang Zhang | T-spline - De Boor Algorithm

slide-7
SLIDE 7

6

De Boor Suitable T-Splines

Admissible T-meshes

◮ No facing T-junctions in the active region ◮ No T-junctions in the frame region

Yang Zhang | T-spline - De Boor Algorithm

slide-8
SLIDE 8

7

De Boor Suitable T-Splines

Admissible T-meshes

Finding the local knots for an anchor:

Yang Zhang | T-spline - De Boor Algorithm

slide-9
SLIDE 9

8

De Boor Suitable T-Splines

Analysis Suitable T-meshes

Analysis Suitable T-meshes

Yang Zhang | T-spline - De Boor Algorithm

slide-10
SLIDE 10

9

De Boor Suitable T-Splines

Analysis Suitable T-meshes

T-junction extensions:

Yang Zhang | T-spline - De Boor Algorithm

slide-11
SLIDE 11

10

De Boor Suitable T-Splines

Analysis Suitable T-meshes

A T-mesh is analysis suitable if the horizontal T-junction extensions do not intersect the vertical T-junction extensions. No touching allowed.

Yang Zhang | T-spline - De Boor Algorithm

slide-12
SLIDE 12

11

De Boor Suitable T-Splines

T-spline Surfaces

T-spline Surfaces

Yang Zhang | T-spline - De Boor Algorithm

slide-13
SLIDE 13

12

De Boor Suitable T-Splines

T-spline Surfaces

◮ Associate to each anchor ν = (i3, j3) a blending function:

Bν(t, s) = N3(i1, i2, i3, i4, i5; t) ∗ N3(j1, j2, j3, j4, j5; s)

◮ For analysis suitable T-splines, the blending functions are linearly

independent and form a partition of unity.

◮ The surface is:

T(s, t) =

  • ν

Pν ∗ Bν(s, t)

Yang Zhang | T-spline - De Boor Algorithm

slide-14
SLIDE 14

13

De Boor Suitable T-Splines

Two Questions

Two questions:

  • 1. How to find the indices for the control points?
  • 2. How to construct the de Boor algorithm for the control points?

Yang Zhang | T-spline - De Boor Algorithm

slide-15
SLIDE 15

14

De Boor Suitable T-Splines

How to find the indices for the control points?

Yang Zhang | T-spline - De Boor Algorithm

slide-16
SLIDE 16

15

De Boor Suitable T-Splines

How to find the indices for the control points?

Yang Zhang | T-spline - De Boor Algorithm

slide-17
SLIDE 17

16

De Boor Suitable T-Splines

How to find the indices for the control points?

Yang Zhang | T-spline - De Boor Algorithm

slide-18
SLIDE 18

17

De Boor Suitable T-Splines

T-junction boxes

de Boor algorithm applies:

Yang Zhang | T-spline - De Boor Algorithm

slide-19
SLIDE 19

18

De Boor Suitable T-Splines

T-junction boxes

de Boor algorithm does not apply:

Yang Zhang | T-spline - De Boor Algorithm

slide-20
SLIDE 20

19

De Boor Suitable T-Splines

Theorem

Theorem:

  • 1. If the 16 anchors can be covered by 4 lines, then the de Boor

algorithm can be applied by first blending along these 4 lines.

  • 2. For Analysis Suitable T-meshes, if the horizontal T-junction boxes

do not overlap the vertical T-junction boxes, then the T-mesh are de Boor Suitable and the de Boor algorithm can always be applied.

Yang Zhang | T-spline - De Boor Algorithm

slide-21
SLIDE 21

Thank you!