Next: Mesh Generation Up: Top Previous: Introduction

Surface Representation

The surface to be discretized is represented by a triangular control grid of arbitrary topology. The boundary edges of the grid form the boundary curves of the surface. The end nodes of each curve represent vertices. Nodes not representing vertices are called curve nodes if they form a curve, otherwise they are called surface nodes.

The limit surface is reconstructed using a subdivision technique. This method is based on the hierarchical recursive refinement of triangular simplexes forming the control grid. Each step of the refinement consists of two stages - splitting and averaging (Fig. 1). In the splitting stage, new nodes are introduced exactly in the middle of individual edges. During the averaging, the nodes are repositioned to a new location evaluated as a weighted average of nodes in the neighbourhood (according to the so called averaging mask). As the level of the refinement grows the resulting grid approaches the limit surface. The averaging scheme may be either interpolating or approximating. While an interpolating scheme produces the limit surface which is passing through the nodes of the control grid (original and refined), the limit surface created by an approximating scheme does not generally interpolate any of the nodes.

In the presented approach, the recursive subdivision based on the modified Butterfly scheme [1] has been employed. It is the interpolating non-uniform stationary scheme, in which the original nodes remain unchanged and the position of a new node (see Fig. 2a) is calculated as

(1)


where stands for the positional vector and are nodes connected to the surface node of valence . The weights and corresponding to the surface averaging mask (Fig. 2a) are given by

(2)


(3)


(4)


(5)


The modified Butterfly scheme exhibits the following advantages:

Similarly, the limit boundary curves are recovered using a one-dimensional interpolating subdivision [2] producing curves. The adopted 4-point and 3-point averaging masks are depicted in Figures 2b and 2c.

The final interpolating procedure evaluates the position of a new node according to the classification and regularity of the end nodes of its parent edge (a surface node of valence 6 is called regular, otherwise it is called irregular):

The properties of the limit curves and surfaces have been derived by a standard examination of the eigenstructure of the local subdivision matrix corresponding to the adopted interpolating scheme [3]. Generally, the evaluation mask for the tangent vector at a curve node is related to the left eigenvector corresponding to the second largest eigenvalue of the local subdivision matrix of the 4-point curve averaging scheme. Similarly, the evaluation masks for two different tangent vectors at a surface node are associated with the two left eigenvectors corresponding to the second largest (double) eigenvalue of the local subdivision matrix of the surface averaging scheme. Since the calculation of these masks is rather expensive all the masks have been precomputed for different values of nodal valence.



Next: Mesh Generation Up: Top Previous: Introduction

Daniel Rypl
2005-12-03