Polynomial Splines Over Tmeshes - PowerPoint PPT Presentation

1 / 53
About This Presentation
Title:

Polynomial Splines Over Tmeshes

Description:

Superfluous control points in modeling local details: to maintain a tensor ... Syzygy method. A general dimension formula for general T-meshes is unknown. ... – PowerPoint PPT presentation

Number of Views:172
Avg rating:3.0/5.0
Slides: 54
Provided by: den92
Category:

less

Transcript and Presenter's Notes

Title: Polynomial Splines Over Tmeshes


1
Polynomial Splines Over T-meshes
  • Falai Chen
  • Department of Mathematics
  • University of Science and Technology
  • of China

2
Outlines
  • Motivation
  • T-meshes
  • Spline spaces over T-meshes
  • Applications
  • Future work

3
  • 1. Motivations

4
Problems with NURBS
  • No local refinement properties two global knot
    vectors.

5
Problems with NURBS
  • Superfluous control points in modeling local
    details to maintain a tensor product structure

Sederberg, et al., 2003
6
Previous Solutions
  • D. Forsey R.H. Bartels Hierarchical B-spline,
    1988
  • F. Weller H. Hagen Tensor-product spline with
    knot segments, 1990
  • T. W. Sederberg et. al T-spline, 20032004

7
Hierarchical B-splines
A hierarchical B-spline surface is the
overlap of a series of layers, with each later
layer B-spline has a resolution twice that of the
previous B-spline. The basis functions
should be refinable.
8
Hierarchical B-splines
  • Hierarchical B-spline is a special type of
    B-spline over T-meshes which allows local
    refinement.

9
TP splines with knot segments
  • Defined over a more general T-mesh, where
    crossing, T-junctional and L-junctional vertices
    are allowed.
  • Dimension are estimated.
  • Semi-regular bases.

10
TP splines with knot segments
11
T-Splines
  • Sederberg et al., SIGGRAPH03 04
  • T-splines are point-based splines
  • They are rational, and are piecewise in each
    cell.
  • Admit local refinement, but the complexity is
    uncertain.

12
T-Splines
13
T-splines comparison with NURBS
pwfwWcNL
Sederberg et al. 2003
14
Our Solution
  • Polynomial Splines
  • over T-meshes

15
  • 2.T-meshes

16
T-meshes
  • T-meshes are generalization of TP meshes, they
    are formed by rectangular grids which allows
    T-junctions.
  • T-meshes have appeared in
  • scientific computing, geometric
  • modeling. But the theory of
  • splines over T-meshes has not
  • been fully build up yet.

17
T-meshes extension
Adaptability
18
T-meshes simplification
TP mesh to T-mesh by simplification
19
T-meshes refinement
TP mesh to T-mesh by refinement
20
Quantities
  • VT number of T-vertices
  • V number of crossing vertices
  • Vb number of boundary vertices
  • Total number of vertices V VT V Vb
  • F number of cells
  • E number of edges
  • Eb number of boundary
  • edges
  • EL number of large edges

21
Topological Identities
  • Eulers formula F E V 1
  • Regular T-mesh
  • 3F E V 1
  • F V EL 1

F 10, E 28, V19, V 3, EL 6
22
  • 3.Splines over T-meshes

23
Definition
  • T T-mesh, F cells in T, ? region occupied by
    T.
  • S(m,n,?,?, T )s(x,y)?C?,?(?) s? is a
    bivariate polynomial of bidegree (m,n) , for any
    ? ? F

24
Dimension formula
  • For m?2?1, n?2?1,
  • dim S F(m1)(n1) Eh(m1)(?1)
    Ev(?1)(n1) V(?1)(?1)
  • where F number of faces Ehnumber of
    horizontal edges Ev number of vertical edges
    V number of inner vertices

25
dim S(1,1,00) and dim S(3,3,1,1)
  • dim S(1,1,0,0) VbV
  • dim S(3,3,1,1) 4(Vb V)
  • Here Vb is the number of boundary vertices,
    V is the number of crossing vertices.
  • For the T-mesh in the right figure, dim
    S(1,1,0,0) 14
  • dim S(3,3,1,1) 4(113) 56

26
Dimension Calculation
  • Three methods
  • Smoothing cofactor method
  • B-net method
  • Syzygy method
  • A general dimension formula for general T-meshes
    is unknown.
  • Is the dimension independent on geometry?

27
Basis functions
  • A set of basis functions bi(u,v) is constructed
    with the following properties
  • Non-negativity
  • Local support
  • Partition of Unity
  • For S(3,3,1,1),each crossing vertex and each
    boundary vertex (which is called basis vertex)
    corresponds to four basis functions.

28
Hierarchical T-mesh
29
Basis construction over hierarchical T-meshes
  • At each new level, basis functions in the
    previous level are modified, and add new basis
    functions corresponding to each new basis vertex.

30
Illustrations of basis functions
31
General T-meshes
  • For general T-meshes,basis functions for
    S(3,3,1,1) can be constructed analogously.
  • The construction process can be generalized to
    the cases m?2?1, n?2?1.

32
Polynomial Spline surfaces over T-meshes
  • Let bi(u,v) be a set of basis functions over
    a T-mesh, and let Ci be the corresponding control
    points, then the polynomial spline surface over
    the T-mesh (PT-Splines for short) is defined by
  • PT-Splines have similar properties like
    B-splines, such as convex property, affine
    invariant property, etc.

33
  • 4. Applications

34
Adaptive Surface Fitting
  • Given a mesh model, we fit the mesh model using
    PT-splines by successive refinement.

19231 points, 38,388 triangles. The result is
obtained in less than one second
35
Adaptive Surface Fittingmethod
  • Keep unchanged the control points associating
    with the old basis functions, and compute the
    control points for the new basis functions
  • Determine the cells whose fitting errors are
    greater than some threshold e, and then subdivide
    these cells into sub-cells to form a new mesh,
    and construct basis functions for the new mesh.
  • Only linear system of equations with small size
    are involved.

36
Adaptive Surface Fitting--Examples
37
Adaptive Surface Fitting--Examples
38
Adaptive Surface Fitting--Examples
39
Adaptive Surface Fitting--Examples
40
Adaptive Surface Fitting--Examples
41
Adaptive Surface Fitting--Examples
42
Adaptive Surface Fitting--Timing
Time(Sec.)
Mesh
level
Facets
43
Stitching PT-Splines
44
Stitching PT-Splines
45
NURBS Conversion
  • PT-splines converted to NURBS

One patch 17 patches
47 patches
46
NURBS Conversion
  • NURBS converted to PT-Splines
  • Remove superfluous control points

8835 CPs 8280 Patches 2592
CPs, 555 Patches, errorlt1.2
1260 CPs,
312 Patches, errorlt1.8
47
Simplification
  • Given a PH-Spline, Simplify it with a PH-Spline
    with less number of patches

48
Future work
  • Splines over general T-meshes
  • Dimension calculation
  • Basis construction
  • Applications of splines over T-meshes
  • Adaptive surface modeling
  • Adaptive finite elements for solving PDEs
  • Relation with wavelet and subdivision

49
  • Thank you for
  • your attention

50
  • Domain

51
TP Splines based on knot segments
  • TP splines are defined on general T-meshes which
    allow T-junctions and L-junctions.
  • Basis functions are semi-regular

52
Local refinement
53
Edges and Faces
  • Edges E
  • Horizontal edge Eh
  • Vertical edge Ev
  • Composite edge
  • Faces F
Write a Comment
User Comments (0)
About PowerShow.com