Construction and smoothing of triangular Coons patches with geodesic boundary curves
|
|
- Cathleen Rich
- 5 years ago
- Views:
Transcription
1 Construction and smoothing of triangular Coons patches with geodesic boundary curves R. T. Farouki, (b) N. Szafran, (a) L. Biard (a) (a) Laboratoire Jean Kuntzmann, Université Joseph Fourier Grenoble, France (b) Department of Mechanical and Aeronautical Engineering, University of California, Davis, CA 95616, USA Abstract Given three regular space curves r 1 (t), r 2 (t) r 3 (t), t [ 0, 1 ] that define a curvilinear triangle, we consider the problem of constructing a C 2 triangular surface patch R(u 1, u 2, u 3 ) bounded by these three curves, such that they are geodesics of the constructed surface. Results from a prior study [6] concerned with tensor product patches are adapted to identify constraints on the given curves for the existence of such geodesic bounded triangular surface patches. For curves satisfying these conditions, the patch is constructed by means of a cubically blended triangular Coons interpolation scheme. A formulation of thin plate spline energy in terms of barycentric coordinates with respect to a general domain triangle is also derived, and used to optimize the smoothness of the geodesic bounded triangular surface patches. Key words: geodesic curves, surface reconstruction, Coons interpolation 1. Introduction In a prior study [6], sufficient and necessary conditions for the boundaries of a four sided analytic surface patch to be geodesic curves of the surface were identified. A Coons interpolation scheme was then developed [7] to construct polynomial and rational examples of such geodesic bounded surface patches, given boundary curves that satisfy the existence conditions. In the present paper, these results are extended to the case of geodesic bounded triangular surface patches, parameterized in terms of barycentric coordinates. Also, the familiar Cartesian expression for thin plate spline energy is transformed to barycentric coordinates defined on a general triangular domain T. In general, Preprint submitted to Elsevier July 1, 2009
2 the barycentric form contains 21 terms, whose coefficients depend explicitly on the geometry of T. This form is used to optimize the shape of geodesic bounded triangular patches with respect to residual free parameters. The motivation for these studies comes from the problem of constructing computer representations of free form surfaces from positional/orientational measurements obtained with the Morphosense a flexible ribbon like device with embedded microsensors that assumes the shape of a geodesic when laid on a smooth physical surface [15]. By orienting the Morphosense in different directions on the surface, it may be divided into a collection of rectangular and triangular patches. Note that constructing triangular geodesic bounded patches is actually a more fundamental problem, since a closed surface of genus zero cannot be entirely covered by four sided patches. The remainder of this paper will be organized as follows. After reviewing some basic facts concerning differential geometry and barycentric coordinates on triangular domains in Section 2, the problem of constructing triangular surface patches with geodesics as boundary curves is described in Section 3, and the methodology for solving it is presented in Section 4. The properties of the constructed surface patches are then discussed, in the context of the Gauss Bonnet theorem, in Section 5. Section 6 develops the thin plate spline energy in terms of barycentric coordinates on general triangle domains, while Section 7 presents computed examples, with shape optimized in terms of this energy. Finally, Section 8 summarizes and assesses key results of the paper. 2. Preliminaries For linearly independent unit vectors u and v, and a unit vector n such that n u and n v, let (u, v) n denote the oriented angle between u, v in the sense of n. Specifically, the angle A = (u, v) n is defined (see Fig. 1) by n v u sin A = det(u, v, n), cos A = u, v. (1) Fig. 1. Angle measurement. We assume the reader is familiar with the elementary differential geometry of curves and surfaces [3, 16] see also [6] for pertinent background. For a space curve r(t) let (e(t), n(t), b(t)) be the Serret Frenet frame, and 2
3 k(t) and τ(t) the curvature and torsion, defined at non inflectional points by e(t) = r (t) r (t), b(t) = r (t) r (t), n(t) = b(t) e(t), (2) r (t) r (t) k(t) = r (t) r (t) r (t) 3 and τ(t) = det(r (t), r (t), r (t)) r (t) r (t) 2. (3) For a regular curve, satisfying r (t) = 0 for all t, the tangent e(t) is defined at every point. At inflection points (where r (t), r (t) are linearly dependent), the curvature k(t) is zero, and the principal normal n(t), binormal b(t), and torsion τ(t) are undefined. Henceforth, we specifically exclude the possibility of pathological inflections i.e., points where the curvature vanishes, and the left and right limits n and n + of the principal normal are neither parallel nor anti parallel, since no solution to the geodesic interpolation problem can be found in the presence of such points. The barycentric coordinates u = (u 1, u 2, u 3 ) of a point p = (x, y) with respect to a domain triangle T with vertices p i = (x i, y i ), i = 1, 2, 3 are given by u 1 u 2 = 1 y 2 y 3 x 3 x 2 x 2 y 3 x 3 y 2 x y 3 y 1 x 1 x 3 x 3 y 1 x 1 y 3 y, (4) u 3 y 1 y 2 x 2 x 1 x 1 y 2 x 2 y 1 1 where = x 1 x 2 x 3 y 1 y 2 y 3. (5) For distinct points p, q the directional derivative along the vector V = q p is defined [4] by 3 D V = (u i (q) u i (p)). u i i=1 Hence, the derivatives along directions parallel to each side s i of T, defined by u i = 0, is D si = u i 1 u i+1, i = 1, 2, 3 (6) where all indices are reduced modulo 3 to the set {1, 2, 3}. 3
4 p 1 u 1 1 = D s 3 D n 3 D n 2 D s 2 u 0 3 = p 2 D n 1 u 1 = 0 p 3 D s 1 u 2 = 1 u 3 = 1 u 0 2 = Fig. 2. Barycentric coordinates relative to the triangle (p 1, p 2, p 3 ). We then define (see Fig. 2) a derivative D ni each side s i by in the inward direction along D ni = α i 1 (u) D si+1 α i+1 (u) D si 1, i = 1, 2, 3 (7) where the three blending functions defined [8] by satisfy α i (u) = u 2 i (3 2 u i + 6 u i 1 u i+1 ), i = 1, 2, 3 3 α i (u) 1. i=1 Note also that, since α i 1 (u) + α i+1 (u) 1 along the side u i = 0 of T, the derivative D ni coincides with the derivative D si+1 at the point p i 1 and D si 1 at the point p i+1, along the side s i. 3. The three-geodesic interpolation problem Consider, as shown in Fig. 3, three regular space curves r 1 (t), r 2 (t), r 3 (t) with t [ 0, 1 ] such that 4
5 r i+1 (1) = p i = r i+2 (0) (8) for i = 1, 2, 3, where all indices are reduced modulo 3 (so that 0 3, 4 1, 5 2). These curves are assumed sufficiently smooth, and their derivatives at the corner points p i, i = 1, 2, 3 are assumed to be linearly independent, so as to define the tangent plane Π i for the interpolating surface R at p i. r (t) 3 r (t) 1 p 1 r (t) 2 p 2 p 3 Fig. 3. Triangular patch boundaries The geodesic interpolation problem Our intent is to construct an oriented surface patch that interpolates the specified curves as its boundaries, in such a manner that they are geodesic paths of the constructed surface. In terms of the barycentric coordinates u = (u 1, u 2, u 3 ) relative to the triangle with vertices p 1, p 2, p 3 the interpolating surface R(u) must have the following properties. Interpolation property: R(0, 1 t, t) = r 1 (t), R(t, 0, 1 t) = r 2 (t), t [ 0, 1 ]. R( 1 t, t, 0) = r 3 (t), (9) Geodesic property: the principal normal n ( t) at each non inflectional point of the curves r i (t) must be normal to the surface R(u). Let (e i (t), n i (t), b i (t)) denote the Serret Frenet frame and k i (t), τ i (t) the curvature and torsion of each of the curves r i (t), as defined by (2) and (3). Let r(t) be the concatenation of the three boundary curves r i (t), defined by r(t) = r i (t i + 1) for t [i 1, i] and i = 1, 2, 3, and consider the principal normal n(t) of this concatenated curve r(t), defined for t [ 0, 3 ] {0, 1, 2}. This normal n(t) is simply the concatenation of the principal normals n i (t) of the individual boundary curves r i (t). Note that the domain of the parameter t is considered to [ 0, 3 ] modulo 3. Now let N(u) be the unit normal to the interpolating surface R(u), and let N(t) for t [ 0, 3 ] be its restriction to the boundary r(t) of the surface 5
6 patch. For a continuous normal function N(t), we define the crossing angles A i at each corner p i by A i = ( e i+1 (1), e i 1 (0) ) N(p i, i = 1, 2, 3. (10) ) Assuming that the principal normals of the two boundary curves meeting at each corner agree (modulo sign) with the unit surface normal N, we consider the values σ il, σ ir { 1, +1} defined by N(0) = N(p 1 ) = σ 2R n 2 (1) = σ 3L n 3 (0), N(1) = N(p 2 ) = σ 3R n 3 (1) = σ 1L n 1 (0), N(2) = N(p 3 ) = σ 1R n 1 (1) = σ 2L n 2 (0). (11) Fig. 4 shows the Frenet frames (e i, n i, b i ) and the Darboux frames (e i, h i, N), with h i (t) = N(t) e i (t), along the patch boundary curves i = 1, 2, 3. p 2 N e 3 r (t) 3 b n 3 p 1 h 3= 3 r (t) 1 N e 2 h 2 N b h 1 = 1 e 1 n 1 n 2 b 2 r (t) 2 p Existence conditions for an interpolating surface Fig. 4. Vectors along patch boundaries. From Proposition 7 in [6], a surface interpolating the boundary curves as geodesics can be found if and only if they satisfy the following constraints: (C1) osculating constraint: the principal normals of the boundary curves that meet at each corner p i must agree modulo sign. This implies that, at each corner p i, the boundary curves meeting there have osculating planes orthogonal to the surface tangent plane Π i ; (C2) global normal orientation constraint: a continuous unit vector function N(t) must exist, such that N(t) = ± n(t) for all t R ; (C3) corner geodesic crossing constraint: for the crossing angles A i and values σ il, σ ir { 1, +1} defined by (10) and (11), the boundary 6
7 curves r i (t) must satisfy the following curvature and torsion constraints at each corner p i : [ σ i+1,r k i+1 (1) σ i 1,L k i 1 (0) ] cos A i + [ τ i+1 (1) + τ i 1 (0) ] sin A i = 0. (12) 4. Three sided geodesic interpolation Given three space curves free of inflection points, that satisfy conditions (C1) (C3), we wish to construct a triangular patch R(u 1, u 2, u 3 ) interpolating the curves as geodesic boundaries. A cubically blended Coons interpolation scheme [8] will be invoked to construct the surface (see also [6, 9, 11, 15] for related prior work on interpolation of geodesic boundary curves) Triangular Geodesic Coons interpolation p 1 For a triangular patch, the cubic Coons interpolation scheme requires a tangent vector T i (t) to be defined along each of the boundary curves r i (t) see Fig. 5. p2 r (t) 3 T 3 (t) T 1 (t) r (t) 1 r (t) 2 T 2 (t) p 3 Fig. 5. Tangent vectors T i (t) along patch boundary curves. In order to satisfy the geodesic constraint, the tangent vectors T i (t) must lie in the surface tangent plane at each point of r i (t), so these tangent vectors can, in general, be expressed in the form T i (t) = d i (t) [ cos(α i (t)) e i (t) + sin(α i (t)) h i (t) ], i = 1, 2, 3, (13) where the angle functions α i (t) specify the inclination of the vectors T i (t) relative to the boundary curve tangents e i (t). As in [6], we will now show that the vector fields T i (t) must satisfy the following two conditions: Interpolation of the corner derivatives (see Section 4.2): T i (0) = r i 1(1) and T i (1) = r i+1(0), i = 1, 2, 3 (14) 7
8 i..e, the tangent vectors T i must coincide with the derivatives of the two curves r i 1 (t), r i+1 (t) meeting the curve r i (t) at its extremities. Twist crossing constraints at the corners (see Section 4.3): The derivatives of the tangent vectors T i (t) must satisfy the following relations, which define the twist vectors W i at the patch corners. T i 1(0) = T i+1(1) =: W i, i = 1, 2, 3. (15) Consider now the C 1 -triangular Coons patch R(u), as developed in [8]: with R(u) = 3 α i (u) R i (u), (16) i=1 R i (u) = r i 1 (u i+1 ) + u i 1 [ T i 1 (u i+1 ) T i 1 (0) ] + r i+1 (1 u i 1 ) + u i+1 [ T i+1 (1 u i 1 ) T i+1 (1) ] p i u i 1 u i+1 W i. (17) A straightforward computation yields R(u) ui =0 = r i(u i 1 ), i = 1, 2, 3, (18) and D ni R(u) ui =0 = [ α i 1(u) D si+1 α i+1 (u) D si 1 ] R(u) ui =0 [ ] 3 = α i+1 (u) α i 1 (u) α i (u) R i (u) u i u i+1 = T i (u i 1 ) u i 1 α i+1 (u) ui =0 [ r i 1(1) + T i (0) + u i 1 (T i 1(1) + W i+1 ) ] i=1 ui =0 + α i 1 (u) ui =0 [ r i+1(0) T i (1) + u i+1 (T i+1(0) W i 1 ) ]. (19) Assuming that the three vector fields T i (t) satisfy conditions (14) (15), the patch R(u) will interpolate the boundary curves r i (t) and the tangent vectors T i (t) precisely: R(u) ui =0 = r i(u), D ni R(u) ui =0 = T i(u), i = 1, 2, 3. (20) 8
9 which proves with our hypothesis that the patch R(u) interpolates the boundary curves r i (t) as geodesics. Consider now constraints (14) and (15). We will establish conditions on the vector fields T i (t) in order to satisfy these constraints. In particular, we show that the twist constraints (15) can only be satisfied if the conditions (C1) (C3) are satisfied by the curves r i (t) Interpolation of corner derivatives T i (0)= -r' i-1 (1) r i-1 (t) r i+1 (t) T i (1)= r' i+1 (0) h i (0) N(p i+1) A i+1 e i-1 (1) e i (0) h i-1 (1) r i (t) e i+1 (0) N(p i-1) A i-1 e i (1) Fig. 6. Vectors along the curve r i (t). To satisfy the constraints (14) on the vector field T i (t), defined by (13), we introduce the following scalar coefficients d il, d ir, α il, α ir (see Fig. 6) for i = 1, 2, 3: d il := d i (0) = r i 1(1), d ir := d i (1) = r i+1(0), α il := α i (0) = π A i+1, α ir := α i (1) = A i 1. (21) Then, as in [6], we consider the functions α i (t) = α il H 0 (t) + α i1 H 1 (t) + α i2 H 2 (t) + α ir H 3 (t), (22) d i (t) = d il H 0 (t) + d i1 H 1 (t) + d i2 H 2 (t) + d ir H 3 (t), (23) where H i (t) are the cubic Hermite polynomials, and the parameters α i1, α i2, d i1, d i2 will be specified in Section
10 4.3. Twist crossing constraints at corners p i r' i+1 (1) e i-1 (0) r' i-1 (0) e (1) i+1 A i N(p ) i h (1) i+1 r (t) i-1 h (0) i-1 r (t) i+1 Fig. 7. Vectors at corner p i. At corner p i, the vectors e i+1 (1), h i+1 (1), e i 1 (0), h i 1 (0) are coplanar and related (see Fig. 7) as follows: e i+1 (1) = cos A i e i 1 (0) sin A i h i 1 (0), e i 1 (0) = cos A i e i+1 (1) + sin A i h i+1 (1). Hence (noting from Section 3 that A i 0, π) we deduce that h i 1 (0) = cos A i e i 1 (0) e i+1 (1), h i+1 (1) = e i 1(0) cos A i e i+1 (1). sin A i sin A i (24) Then using the definitions (13), (22), (23), relations (11), (21) and the Serret- Frenet relations as in [6], with b i+1 (1) = σ i+1,r h i+1 (1), b i 1 (0) = σ i 1,L h i 1 (0), we express each of the derivatives occurring in (15) with respect to the frame (e i+1 (1), e i 1 (0), N(p i )) as [ T i 1(0) = d i 1(0) + r i+1(1) α i 1(0) cos A ] i e i+1 (1) sin A i r i+1(1) α i 1(0) 1 e i 1 (0) sin A [ i ] + r i+1(1) r i 1(0) cos A i σ i 1,L k i 1 (0) + sin A i τ i 1 (0) N(p i ), 10
11 T i+1(1) = r i 1(0) α i+1(1) 1 e i+1 (1) sin A i [ + d i+1(1) + r i 1(0) α i+1(1) cos A ] i e i 1 (0) sin A [ i ] + r i+1(1) r i 1(0) cos A i σ i+1,r k i+1 (1) + sin A i τ i+1 (1) N(p i ). Thus, the twist crossing constraint (15) at corner p i, together with definitions (21) (23), yields the following system of equations cos A i 1 d i 1,1 + d i 1,L α i 1,1 = d i+1,r α i+1,2, sin A i sin A i d i 1,L α i 1,1 1 sin A i = d i+1,2 d i+1,r α i+1,2 cos A i sin A i, cos A i σ i 1,L k i 1 (0) + sin A i τ i 1 (0) = cos A i σ i+1,r k i+1 (1) sin A i τ i+1 (1). (25) As in [6], identifying components of the twist crossing constraint (15) in the direction of N(p i ) at corner p i yields the geodesic crossing relation (12) at that point, which is satisfied through the assumption that the boundary curves obey conditions (C1) (C3) in Section 3.2. Thus, multiplying equations (25) by sin A i yields the following linear equations in the four unknowns d i 1,1, α i 1,1, d i+1,2, α i+1,2 : { sin Ai d i 1,1 + cos A i d i 1,L α i 1,1 d i+1,r α i+1,2 = 0, (26) d i 1,L α i 1,1 + sin A i d i+1,2 + cos A i d i+1,r α i+1,2 = 0. This linear system is of rank 2, and if S i denotes the set of its solutions, we have dim(s i )=2 (see Section 7 for examples illustrating the influence of the free parameters in S i, i = 1, 2, 3). Thus, we are able to define a twist vector W i at the patch corner p i, and we can now state the following result. Proposition 1. Given three regular space curves, that satisfy the conditions (C1) (C3) specified in Section 3.2, an oriented triangular surface patch R(u) exists, that interpolates these curves as boundaries in such a way that they are geodesics of the surface. Conversely, when any of the conditions (C1) (C3) is not satisfied, such an interpolating surface can not be constructed. 11
12 5. Gauss Bonnet theorem The well known Gauss Bonnet theorem relates the integral of Gaussian curvature over a region of a surface to the integral of the geodesic curvature along the boundary of that region. This theorem is of particular relevance to the geodesic bounded surface patches constructed herein. Theorem 1. Global Gauss-Bonnet Theorem [3, 16]. Let R S be a regular simple region of an oriented surface S and Γ 1,..., Γ k be closed, simple, piecewise regular curves forming its boundary R. Suppose that Γ 1,..., Γ k are all positively oriented, and let A 1,..., A k be the external angles at the junctures of the curves Γ 1,..., Γ k, as defined by (10). Then k i=1 Γ i k i (s) ds + R K dσ + k A i = 2π, (27) where k i (s) is the geodesic curvature of the curve Γ i, s is arc length along it, and K is the Gaussian curvature of the surface S with area element dσ. Since the geodesic curvature vanishes along any geodesic curve, it follows from the above theorem that if we construct a triangular surface patch R(u) as described in Proposition 1, so that its boundary curves are geodesics, the Gaussian curvature K of this surface must satisfy R K dσ = 2π i=1 3 A i, (28) where A 1, A 2, A 3 are the corner angles at the vertices p 1, p 2, p 3. i=1 Fig. 8. Gauss Bonnet triangle. 12
13 For example, given three regular space curves r i (t) satisfying conditions (C1) (C3), such that 3 i=1 A i = 2π, as in Fig. 8, any interpolating surface R(u) constructed as described in Proposition 1 must satisfy K dσ = 0, (29) R which indicates that the interpolating surface must contain both elliptic and hyperbolic points (where K > 0 and K < 0) see Fig. 9. Fig. 9. Two views of a surface interpolating the Gauss Bonnet triangle of Fig. 8 as geodesics. The free parameters d ij and α ij are set equal to zero. Consider the problem of smoothing the interpolating surface. From (28), we see that the integral of the Gaussian curvature will be the same for all geodesic bounded interpolating surfaces R(u). Thus, one natural choice is to minimize the variation of Gaussian curvature over the surface. Another choice is based on minimizing the thin plate spline energy, adapted to the context of triangular patches as described below. 6. Thin plate spline energy for triangular patches For a bivariate function f(x, y) the thin plate spline energy per unit area is defined by E = f 2 xx + 2f 2 xy + f 2 yy. (30) 13
14 This expression is clearly invariant under any translation, since it depends only on the second derivatives of f. One can easily see that it is also invariant under any rotation, specified by [ ] [ ] [ ] x cos θ sin θ x y =. sin θ cos θ y Applying the derivative operators x = x x x y = x y x + y x + y y y = cos θ x sin θ y, y = sin θ x + cos θ y, twice to f, one can verify that f 2 x x + 2f 2 x y + f 2 y y f 2 xx + 2f 2 xy + f 2 yy. Hence, for Cartesian coordinates, the thin plate spline energy per unit area (30) is a universal expression. Consider now the formulation of the thin plate spline energy in terms of the barycentric coordinates (4) with respect to a domain triangle T with the vertices p i = (x i, y i ) for i = 1, 2, 3. To transform derivatives with respect to (x, y) into derivatives with respect to (u 1, u 2, u 3 ) we use the relations x = u 1 + u 2 + u 3 x u 1 x u 2 x u 3 = 1 [ ] (y 2 y 3 ) u1 + (y 3 y 1 ) u2 + (y 1 y 2 ) u3, y = u 1 + u 2 + u 3 y u 1 y u 2 y u 3 = 1 [ ] (x 3 x 2 ) u1 + (x 1 x 3 ) u2 + (x 2 x 1 ) u3. (31) Clearly, these derivative operators depend explicitly on the chosen vertices of the domain triangle T. Consequently, there is no universal barycentric formulation of the expression (30). It was noted above that (30) is invariant under transformations of the Cartesian coordinates that correspond to rigid motions. However, mappings between barycentric coordinates with respect to 14
15 different domain triangles define general affine transformations, not just rigid motions. Hence, each domain triangle T has its own associated expression for the thin plate spline energy, dependent on the vertices of T. We denote the second derivatives of f with respect to (u 1, u 2, u 3 ) by f jk = 2 f u j u k, 1 j, k 3. The expression for E in barycentric coordinates with respect to an arbitrary domain triangle T contains 21 terms the squares of the 6 second derivatives f 11, f 22, f 33, f 12, f 23, f 31 and the ( 6 2) = 15 cross terms arising from their pair wise products. The coefficients of these 21 terms will depend on the chosen vertices of T. Using the partial derivatives (31) and writing x jk = x j x k and y jk = y j x k for 1 j, k 3 we obtain 2 f xx = y 2 23f 11 + y 2 31f 22 + y 2 12f (y 23 y 31 f 12 + y 31 y 12 f 23 + y 12 y 23 f 31 ), 2 f xy = x 32 y 23 f 11 + x 13 y 31 f 22 + x 21 y 12 f 33 + (x 13 y 23 + x 32 y 31 )f 12 + (x 21 y 31 + x 13 y 12 )f 23 + (x 21 y 23 + x 32 y 12 )f 31, 2 f yy = x 2 32f 11 + x 2 13f 22 + x 2 21f (x 32 x 13 f 12 + x 13 x 21 f 23 + x 21 x 32 f 31 ), Defining the sides of the domain triangle T by s 1 = p 3 p 2, s 2 = p 1 p 3, s 3 = p 2 p 1, one can then verify that expression (30) becomes 4 E = s 1 4 f s 2 4 f s 3 4 f [ s 1 2 s (s 1 s 2 ) 2 ] f [ s 2 2 s (s 2 s 3 ) 2 ] f [ s 3 2 s (s 3 s 1 ) 2 ] f (s 1 s 2 ) 2 f 11 f (s 2 s 3 ) 2 f 22 f (s 3 s 1 ) 2 f 33 f f 11 [ s 1 2 (s 1 s 2 ) f 12 + (s 1 s 2 )(s 3 s 1 ) f 23 + s 1 2 (s 3 s 1 ) f 31 ] + 4 f 22 [ s 2 2 (s 1 s 2 ) f 12 + s 2 2 (s 2 s 3 ) f 23 + (s 1 s 2 )(s 3 s 1 ) f 31 ] + 4 f 33 [ (s 2 s 3 )(s 3 s 1 ) f 12 + s 3 2 (s 2 s 3 ) f 23 + s 3 2 (s 3 s 1 ) f 31 ] + 4 [ s 2 2 (s 3 s 1 ) + (s 1 s 2 )(s 2 s 3 ) ] f 12 f [ s 3 2 (s 1 s 2 ) + (s 2 s 3 )(s 3 s 1 ) ] f 23 f [ s 1 2 (s 2 s 3 ) + (s 3 s 1 )(s 1 s 2 ) ] f 31 f 12. (32) 15
16 If l 1 = s 1, l 2 = s 2, l 3 = s 3 are the lengths of the domain triangle sides, and θ 1, θ 2, θ 3 are its interior angles at the vertices p 1, p 2, p 3 so that s 1 s 2 = l 1 l 2 cos θ 3, s 2 s 3 = l 2 l 3 cos θ 1, s 3 s 1 = l 3 l 1 cos θ 2, the expression (32) can also be written as 4 E = l 4 1 f l 4 2 f l 4 3 f l 2 1l 2 2(1 + cos 2 θ 3 ) f l 2 2l 2 3(1 + cos 2 θ 1 ) f l 2 3l 2 1(1 + cos 2 θ 2 ) f l 2 1l 2 2 cos 2 θ 3 f 11 f l 2 2l 2 3 cos 2 θ 1 f 22 f l 2 3l 2 1 cos 2 θ 2 f 33 f l 2 1 f 11 (l 2 l 3 cos θ 2 cos θ 3 f 23 l 1 l 2 cos θ 3 f 12 l 3 l 1 cos θ 2 f 31 ) + 4 l 2 2 f 22 (l 3 l 1 cos θ 3 cos θ 1 f 31 l 1 l 2 cos θ 3 f 12 l 2 l 3 cos θ 1 f 23 ) + 4 l 2 3 f 33 (l 1 l 2 cos θ 1 cos θ 2 f 12 l 2 l 3 cos θ 1 f 23 l 3 l 1 cos θ 2 f 31 ) + 4 l 2 1l 2 l 3 (cos θ 2 cos θ 3 cos θ 1 ) f 31 f l 1 l 2 2l 3 (cos θ 3 cos θ 1 cos θ 2 ) f 12 f l 1 l 2 l 2 3 (cos θ 1 cos θ 2 cos θ 3 ) f 23 f 31. An adaptation of the thin plate spline energy (30) is often invoked in the problem of smoothing a rectangular (tensor product) surface patch R(u, v) for (u, v) [ 0, 1 ] [ 0, 1 ]. Specifically, the expression E = R uu R uv 2 + R vv 2 is employed in lieu of (30). The equivalent expression for a triangular surface R(u 1, u 2, u 3 ) parameterized by barycentric coordinates on a domain triangle T is obtained by replacing f 11, f 12, etc, by R 11, R 12, etc, with the cross terms f 11 f 22, f 12 f 23, etc, replaced by the dot products R 11 R 22, R 12 R 23, etc. Here R jk = 2 R/ u j u k for 1 j, k 3. The three patch corner points p 1 = R(1, 0, 0), p 2 = R(0, 1, 0), p 3 = R(0, 0, 1) are a natural choice for the vertices of the barycentric coordinates domain triangle T. 7. Smoothing methods and computed examples We seek optimal values for the parameters d ij, α ij in the set S = 3 i=1s i which provide smooth interpolating surfaces. For this purpose, we propose to minimize one of the following functionals. 16
17 Criterion A minimization of the thin plate spline energy E expressed in terms of barycentric coordinates relative to the reference domain triangle T, as developed Section 6: min E du. S T Criterion B: minimization of the expression where D 2 s i s j = D si D sj ( ) min D S T 2 s i s j R(u) 2 du, 1 i,j 3 and T is the reference domain triangle. Fig. 10 illustrates the smoothing of geodesic bounded triangular patches using these two measures, for the case of the boundary curves shown in Fig. 8. (1) (2) (3) Criterion A (4) Criterion B (1) (2) 17
18 (3) Criterion A (4) Criterion B Fig. 10. Two differents views of the Gauss Bonnet example of Fig. 8, before and after smoothing: (1) the three boundary curves; (2) the initial reconstructed surface with free parameters d ij equal to zero; (3) the reconstructed surface after smoothing according to criterion A; and (4) the reconstructed surface after smoothing according to criterion B. The optimization is carried out with respect to the parameters d ij the parameters α ij are evaluated from (26). For criterion A and criterion B, the smoothness measure is reduced by a factor of approximately 2. Figs illustrate triangular patches with boundary curves defined by geodesics on some simple quadric surfaces a sphere, cylinder, and cone. Fig. 11. Three geodesics on a sphere and the reconstructed surface. 18
19 Fig. 12. Three geodesics on a cylinder and the reconstructed surface. (a) (b) (c) 19
20 Fig. 13. Geodesic triangle on a cone: (a) the cone and the three geodesic curves; (b) the cone, the three geodesic curves and the interpolating surface; and (c) the three geodesic curves and the interpolating surface alone. 8. Conclusion Given three space curves that define a curvilinear triangle, a method has been presented for constructing a triangular surface patch bounded by these curves, such that they are geodesic curves of the constructed surface. For the construction to be feasible, the given boundary curves must satisfy certain a priori compatibility conditions. In order to optimize the smoothness of the geodesic bounded triangular patches, a formulation of the thin plate spline energy in terms of barycentric coordinates with respect to a general domain triangle was also derived. This formulation is more complicated (containing 21 terms) than the familiar Cartesian expression, and its coefficients depend explicitly on the shape of the domain triangle. The availability of triangular geodesic bounded patches, in conjunction with earlier formulations for rectangular geodesic bounded patches, allows one to reconstruct surfaces from general networks of geodesic paths on them, as physically determined by the Morphosense device. Acknowledgment. Part of this work was accomplished during the visit of the third author to the Department of Mechanical & Aeronautical Engineering, University of California, Davis. References [1] Coons, S., Surfaces for Computer Aided Design, Technical Report, M.I.T., 1964 (available as AD from National Technical Information Service, Springfield, VA 22161). [2] Coons, S., Surface patches and B-spline curves, R. Barnhill and R. Riesenfeld, editors, Computer Aided Geometric Design, Academic Press, [3] Do Carmo, M. P., Differential Geometry of Curves and Surfaces, Prentice Hall, [4] Farin, G., Triangular Bernstein Bézier patches, Computer Aided Geometric Design 3, ,
21 [5] Farin, G., Curves and Surfaces for CAGD, 5th Edition, Academic Press, [6] Farouki R. T., N. Szafran, L. Biard, Existence conditions for Coons patches interpolating geodesic boundary curves, Computer Aided Geometric Design, 2009, in press, doi: /j.cagd [7] Farouki R. T., N. Szafran, L. Biard, Construction of Bézier surface patches with Bézier curves as geodesic boundaries, Computer Aided Design, to appear, [8] Gregory J. A., P. Charrot, A C 1 triangular interpolation patch for computer aided geometric design, Computer Graphics and Image Processing 13, 80 87, [9] Paluszny, M., Cubic polynomial patches through geodesics, Computer Aided Design 40, 56-61, [10] Peters, J., Local smooth surface interpolation: A classification, Computer Aided Geometric Design 7, [11] Sánchez Reyes J., R. Dorado, Constrained design of polynomial surfaces from geodesic curves, Computer Aided Design 40, 49-55, [12] Sarraga, R. F., G1 interpolation of generally unrestricted cubic Bézier curves, Computer Aided Geometric Design 4, 23-39, [13] Shirman, L. A., Séquin, C. H., Local surface interpolation with Bézier patches, Computer Aided Geometric Design 4, , [14] Sprynski, N., Reconstruction de courbes et surfaces à partir de données tangentielles, Laboratoires CEA/LETI, LJK, Thèse de l université Joseph Fourier, Grenoble; 5 Juillet [15] Sprynski N., N. Szafran, B. Lacolle, L. Biard, Surface reconstruction via geodesic interpolation, Computer Aided Design 40, , [16] Struik, D. J., Lectures on Classical Differential Geometry, Dover (reprint),
(Discrete) Differential Geometry
(Discrete) Differential Geometry Motivation Understand the structure of the surface Properties: smoothness, curviness, important directions How to modify the surface to change these properties What properties
More informationCurves and Surfaces for Computer-Aided Geometric Design
Curves and Surfaces for Computer-Aided Geometric Design A Practical Guide Fourth Edition Gerald Farin Department of Computer Science Arizona State University Tempe, Arizona /ACADEMIC PRESS I San Diego
More informationReview 1. Richard Koch. April 23, 2005
Review Richard Koch April 3, 5 Curves From the chapter on curves, you should know. the formula for arc length in section.;. the definition of T (s), κ(s), N(s), B(s) in section.4. 3. the fact that κ =
More informationFinal Review II: Examples
Final Review II: Examles We go through last year's nal. This should not be treated as a samle nal. Question. Let (s) cos s; cos s; sin s. a) Prove that s is the arc length arameter. b) Calculate ; ; T
More informationDiscrete Coons patches
Computer Aided Geometric Design 16 (1999) 691 700 Discrete Coons patches Gerald Farin a,, Dianne Hansford b,1 a Computer Science and Engineering, Arizona State University, Tempe, AZ 85287-5406, USA b NURBS
More informationFathi El-Yafi Project and Software Development Manager Engineering Simulation
An Introduction to Geometry Design Algorithms Fathi El-Yafi Project and Software Development Manager Engineering Simulation 1 Geometry: Overview Geometry Basics Definitions Data Semantic Topology Mathematics
More informationIntroduction p. 1 What Is Geometric Modeling? p. 1 Computer-aided geometric design Solid modeling Algebraic geometry Computational geometry
Introduction p. 1 What Is Geometric Modeling? p. 1 Computer-aided geometric design Solid modeling Algebraic geometry Computational geometry Representation Ab initio design Rendering Solid modelers Kinematic
More informationMotivation. Parametric Curves (later Surfaces) Outline. Tangents, Normals, Binormals. Arclength. Advanced Computer Graphics (Fall 2010)
Advanced Computer Graphics (Fall 2010) CS 283, Lecture 19: Basic Geometric Concepts and Rotations Ravi Ramamoorthi http://inst.eecs.berkeley.edu/~cs283/fa10 Motivation Moving from rendering to simulation,
More informationCurve and Surface Basics
Curve and Surface Basics Implicit and parametric forms Power basis form Bezier curves Rational Bezier Curves Tensor Product Surfaces ME525x NURBS Curve and Surface Modeling Page 1 Implicit and Parametric
More informationSung-Eui Yoon ( 윤성의 )
CS480: Computer Graphics Curves and Surfaces Sung-Eui Yoon ( 윤성의 ) Course URL: http://jupiter.kaist.ac.kr/~sungeui/cg Today s Topics Surface representations Smooth curves Subdivision 2 Smooth Curves and
More informationShape Modeling and Geometry Processing
252-0538-00L, Spring 2018 Shape Modeling and Geometry Processing Discrete Differential Geometry Differential Geometry Motivation Formalize geometric properties of shapes Roi Poranne # 2 Differential Geometry
More informationGeneralized barycentric coordinates
Generalized barycentric coordinates Michael S. Floater August 20, 2012 In this lecture, we review the definitions and properties of barycentric coordinates on triangles, and study generalizations to convex,
More informationON THE GEODESIC TORSION OF A TANGENTIAL INTERSECTION CURVE OF TWO SURFACES IN R Introduction
ON THE GEODESIC TORSION OF A TANGENTIAL INTERSECTION CURVE OF TWO SURFACES IN R 3 B. UYAR DÜLDÜL and M. ÇALIŞKAN Abstract. In this paper, we find the unit tangent vector and the geodesic torsion of the
More informationParameterization of triangular meshes
Parameterization of triangular meshes Michael S. Floater November 10, 2009 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to
More informationVisualizing High-Order Surface Geometry
1 Computer-Aided Design and Applications 2009 CAD Solutions, LLC http://www.cadanda.com Visualizing High-Order Surface Geometry Pushkar P. Joshi 1,2 and Carlo H. Séquin 2 1 Adobe Systems Inc., pushkarj@adobe.com
More informationON THE GEODESIC TORSION OF A TANGENTIAL INTERSECTION CURVE OF TWO SURFACES IN R Introduction
Acta Math. Univ. Comenianae Vol. LXXXII, (3), pp. 77 89 77 ON THE GEODESIC TORSION OF A TANGENTIAL INTERSECTION CURVE OF TWO SURFACES IN R 3 B. UYAR DÜLDÜL and M. ÇALIŞKAN Abstract. In this paper, we find
More informationRational Bezier Surface
Rational Bezier Surface The perspective projection of a 4-dimensional polynomial Bezier surface, S w n ( u, v) B i n i 0 m j 0, u ( ) B j m, v ( ) P w ij ME525x NURBS Curve and Surface Modeling Page 97
More informationBackground for Surface Integration
Background for urface Integration 1 urface Integrals We have seen in previous work how to define and compute line integrals in R 2. You should remember the basic surface integrals that we will need to
More informationSpline Curves. Spline Curves. Prof. Dr. Hans Hagen Algorithmic Geometry WS 2013/2014 1
Spline Curves Prof. Dr. Hans Hagen Algorithmic Geometry WS 2013/2014 1 Problem: In the previous chapter, we have seen that interpolating polynomials, especially those of high degree, tend to produce strong
More informationPythagorean - Hodograph Curves: Algebra and Geometry Inseparable
Rida T. Farouki Pythagorean - Hodograph Curves: Algebra and Geometry Inseparable With 204 Figures and 15 Tables 4y Springer Contents 1 Introduction 1 1.1 The Lure of Analytic Geometry 1 1.2 Symbiosis of
More informationGAUSS-BONNET FOR DISCRETE SURFACES
GAUSS-BONNET FOR DISCRETE SURFACES SOHINI UPADHYAY Abstract. Gauss-Bonnet is a deep result in differential geometry that illustrates a fundamental relationship between the curvature of a surface and its
More informationChapter 6. Curves and Surfaces. 6.1 Graphs as Surfaces
Chapter 6 Curves and Surfaces In Chapter 2 a plane is defined as the zero set of a linear function in R 3. It is expected a surface is the zero set of a differentiable function in R n. To motivate, graphs
More information04 - Normal Estimation, Curves
04 - Normal Estimation, Curves Acknowledgements: Olga Sorkine-Hornung Normal Estimation Implicit Surface Reconstruction Implicit function from point clouds Need consistently oriented normals < 0 0 > 0
More informationIn this lecture we introduce the Gauss-Bonnet theorem. The required section is The optional sections are
Math 348 Fall 2017 Lectures 20: The Gauss-Bonnet Theorem II Disclaimer. As we have a textbook, this lecture note is for guidance and supplement only. It should not be relied on when preparing for exams.
More informationOn Smooth Bicubic Surfaces from Quad Meshes
On Smooth Bicubic Surfaces from Quad Meshes Jianhua Fan and Jörg Peters Dept CISE, University of Florida Abstract. Determining the least m such that one m m bi-cubic macropatch per quadrilateral offers
More informationCentral issues in modelling
Central issues in modelling Construct families of curves, surfaces and volumes that can represent common objects usefully; are easy to interact with; interaction includes: manual modelling; fitting to
More informationVariational Design and Fairing of Spline Surfaces
EUROGRAPHICS 94 / M. Daehlen and L. Kjelldahl (Guest Editors), Blackwell Publishers Eurographics Association, 1994 Volume 13, (1994), number 3 Variational Design and Fairing of Spline Surfaces Günther
More informationDifferential Geometry MAT WEEKLY PROGRAM 1-2
15.09.014 WEEKLY PROGRAM 1- The first week, we will talk about the contents of this course and mentioned the theory of curves and surfaces by giving the relation and differences between them with aid of
More informationBernstein-Bezier Splines on the Unit Sphere. Victoria Baramidze. Department of Mathematics. Western Illinois University
Bernstein-Bezier Splines on the Unit Sphere Victoria Baramidze Department of Mathematics Western Illinois University ABSTRACT I will introduce scattered data fitting problems on the sphere and discuss
More informationEnvelopes Computational Theory and Applications
Envelopes Computational Theory and Applications Category: survey Abstract for points, whose tangent plane maps to a line under the projection. These points form the so-called Based on classical geometric
More information2Surfaces. Design with Bézier Surfaces
You don t see something until you have the right metaphor to let you perceive it. James Gleick Surfaces Design with Bézier Surfaces S : r(u, v) = Bézier surfaces represent an elegant way to build a surface,
More informationMeasuring Lengths The First Fundamental Form
Differential Geometry Lia Vas Measuring Lengths The First Fundamental Form Patching up the Coordinate Patches. Recall that a proper coordinate patch of a surface is given by parametric equations x = (x(u,
More informationComputer Graphics Curves and Surfaces. Matthias Teschner
Computer Graphics Curves and Surfaces Matthias Teschner Outline Introduction Polynomial curves Bézier curves Matrix notation Curve subdivision Differential curve properties Piecewise polynomial curves
More informationCorners in Planar Cubic B-spline and Bezier Curve Segments
8 Corners in Planar Cubic B-spline Bezier Curve Segments DJ. Walton D.S. Meek Department of Computer Science University of Manitoba Winnipeg Canada R3T N Abstract A cubic B-spline or Bezier curve segment
More informationAlmost Curvature Continuous Fitting of B-Spline Surfaces
Journal for Geometry and Graphics Volume 2 (1998), No. 1, 33 43 Almost Curvature Continuous Fitting of B-Spline Surfaces Márta Szilvási-Nagy Department of Geometry, Mathematical Institute, Technical University
More informationParameterization. Michael S. Floater. November 10, 2011
Parameterization Michael S. Floater November 10, 2011 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to generate from point
More informationCOMPUTER AIDED ENGINEERING DESIGN (BFF2612)
COMPUTER AIDED ENGINEERING DESIGN (BFF2612) BASIC MATHEMATICAL CONCEPTS IN CAED by Dr. Mohd Nizar Mhd Razali Faculty of Manufacturing Engineering mnizar@ump.edu.my COORDINATE SYSTEM y+ y+ z+ z+ x+ RIGHT
More informationINSTRUCTIONAL PLAN L( 3 ) T ( ) P ( ) Instruction Plan Details: DELHI COLLEGE OF TECHNOLOGY & MANAGEMENT(DCTM), PALWAL
DELHI COLLEGE OF TECHNOLOGY & MANAGEMENT(DCTM), PALWAL INSTRUCTIONAL PLAN RECORD NO.: QF/ACD/009 Revision No.: 00 Name of Faculty: Course Title: Theory of elasticity L( 3 ) T ( ) P ( ) Department: Mechanical
More informationLecture 25: Bezier Subdivision. And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10
Lecture 25: Bezier Subdivision And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10 1. Divide and Conquer If we are going to build useful
More informationFlank Millable Surface Design with Conical and Barrel Tools
461 Computer-Aided Design and Applications 2008 CAD Solutions, LLC http://www.cadanda.com Flank Millable Surface Design with Conical and Barrel Tools Chenggang Li 1, Sanjeev Bedi 2 and Stephen Mann 3 1
More informationFilling Holes with B-spline Surfaces
Journal for Geometry and Graphics Volume 6 (22), No. 1, 83 98. Filling Holes with B-spline Surfaces Márta Szilvási-Nagy Department of Geometry, Budapest University of Technology and Economics Egry József
More informationApproximating Point Clouds by Generalized Bézier Surfaces
WAIT: Workshop on the Advances in Information Technology, Budapest, 2018 Approximating Point Clouds by Generalized Bézier Surfaces Péter Salvi 1, Tamás Várady 1, Kenjirō T. Miura 2 1 Budapest University
More informationComputer Animation. Rick Parent
Algorithms and Techniques Interpolating Values Animation Animator specified interpolation key frame Algorithmically controlled Physics-based Behavioral Data-driven motion capture Motivation Common problem:
More informationC 1 Quadratic Interpolation of Meshes
C 1 Quadratic Interpolation of Meshes David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License.
More informationA New Class of Quasi-Cubic Trigonometric Bezier Curve and Surfaces
A New Class of Quasi-Cubic Trigonometric Bezier Curve and Surfaces Mridula Dube 1, Urvashi Mishra 2 1 Department of Mathematics and Computer Science, R.D. University, Jabalpur, Madhya Pradesh, India 2
More informationEstimating normal vectors and curvatures by centroid weights
Computer Aided Geometric Design 21 (2004) 447 458 www.elsevier.com/locate/cagd Estimating normal vectors and curvatures by centroid weights Sheng-Gwo Chen, Jyh-Yang Wu Department of Mathematics, National
More informationFreeform Curves on Spheres of Arbitrary Dimension
Freeform Curves on Spheres of Arbitrary Dimension Scott Schaefer and Ron Goldman Rice University 6100 Main St. Houston, TX 77005 sschaefe@rice.edu and rng@rice.edu Abstract Recursive evaluation procedures
More informationarxiv: v2 [math.na] 26 Jan 2015
Smooth Bézier Surfaces over Unstructured Quadrilateral Meshes arxiv:1412.1125v2 [math.na] 26 Jan 2015 Michel Bercovier 1 and Tanya Matskewich 2 1 The Rachel and Selim Benin School of Computer Science and
More informationFor each question, indicate whether the statement is true or false by circling T or F, respectively.
True/False For each question, indicate whether the statement is true or false by circling T or F, respectively. 1. (T/F) Rasterization occurs before vertex transformation in the graphics pipeline. 2. (T/F)
More informationMAC2313 Final A. a. The vector r u r v lies in the tangent plane of S at a given point. b. S f(x, y, z) ds = R f(r(u, v)) r u r v du dv.
MAC2313 Final A (5 pts) 1. Let f(x, y, z) be a function continuous in R 3 and let S be a surface parameterized by r(u, v) with the domain of the parameterization given by R; how many of the following are
More informationPreliminary Mathematics of Geometric Modeling (3)
Preliminary Mathematics of Geometric Modeling (3) Hongxin Zhang and Jieqing Feng 2006-11-27 State Key Lab of CAD&CG, Zhejiang University Differential Geometry of Surfaces Tangent plane and surface normal
More informationCOMPUTER AIDED GEOMETRIC DESIGN. Thomas W. Sederberg
COMPUTER AIDED GEOMETRIC DESIGN Thomas W. Sederberg January 31, 2011 ii T. W. Sederberg iii Preface This semester is the 24 th time I have taught a course at Brigham Young University titled, Computer Aided
More informationHow to use Geometric Software in Courses of Differential Geometry
How to use Geometric Software in Courses of Differential Geometry TOMICZKOVÁ Světlana, JEŽEK František KMA FAV ZČU Plzeň 2018 Coimbra 2018 How to use Geometric Software in Courses of Differential Geometry
More informationMOTION OF A LINE SEGMENT WHOSE ENDPOINT PATHS HAVE EQUAL ARC LENGTH. Anton GFRERRER 1 1 University of Technology, Graz, Austria
MOTION OF A LINE SEGMENT WHOSE ENDPOINT PATHS HAVE EQUAL ARC LENGTH Anton GFRERRER 1 1 University of Technology, Graz, Austria Abstract. The following geometric problem originating from an engineering
More informationCurriculum Vitae of the Authors
Curriculum Vitae of the Authors Mario Hirz has been awarded an M.S. degree in mechanical engineering and economics, a Ph.D. in mechanical engineering, and a venia docendi in the area of virtual product
More informationCurves and Surfaces Computer Graphics I Lecture 9
15-462 Computer Graphics I Lecture 9 Curves and Surfaces Parametric Representations Cubic Polynomial Forms Hermite Curves Bezier Curves and Surfaces [Angel 10.1-10.6] February 19, 2002 Frank Pfenning Carnegie
More informationCSE 554 Lecture 7: Deformation II
CSE 554 Lecture 7: Deformation II Fall 2011 CSE554 Deformation II Slide 1 Review Rigid-body alignment Non-rigid deformation Intrinsic methods: deforming the boundary points An optimization problem Minimize
More informationAdaptive and Smooth Surface Construction by Triangular A-Patches
Adaptive and Smooth Surface Construction by Triangular A-Patches Guoliang Xu Institute of Computational Mathematics and Scientific/Engineering Computing, Chinese Academy of Sciences, Beijing, China Abstract
More informationECE 600, Dr. Farag, Summer 09
ECE 6 Summer29 Course Supplements. Lecture 4 Curves and Surfaces Aly A. Farag University of Louisville Acknowledgements: Help with these slides were provided by Shireen Elhabian A smile is a curve that
More informationMAT203 OVERVIEW OF CONTENTS AND SAMPLE PROBLEMS
MAT203 OVERVIEW OF CONTENTS AND SAMPLE PROBLEMS MAT203 covers essentially the same material as MAT201, but is more in depth and theoretical. Exam problems are often more sophisticated in scope and difficulty
More informationBS-Patch: Constrained Bezier Parametric Patch
BS-Patch: Constrained Bezier Parametric Patch VACLAV SKALA, VIT ONDRACKA Department of Computer Science and Engineering University of West Bohemia Univerzitni 8, CZ 06 14 Plzen CZECH REPUBLIC skala@kiv.zcu.cz
More informationJustin Solomon MIT, Spring 2017
http://www.alvinomassage.com/images/knot.jpg Justin Solomon MIT, Spring 2017 Some materials from Stanford CS 468, spring 2013 (Butscher & Solomon) What is a curve? A function? Not a curve Jams on accelerator
More information3. The three points (2, 4, 1), (1, 2, 2) and (5, 2, 2) determine a plane. Which of the following points is in that plane?
Math 4 Practice Problems for Midterm. A unit vector that is perpendicular to both V =, 3, and W = 4,, is (a) V W (b) V W (c) 5 6 V W (d) 3 6 V W (e) 7 6 V W. In three dimensions, the graph of the equation
More informationGeometric approximation of curves and singularities of secant maps Ghosh, Sunayana
University of Groningen Geometric approximation of curves and singularities of secant maps Ghosh, Sunayana IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish
More informationPS Geometric Modeling Homework Assignment Sheet I (Due 20-Oct-2017)
Homework Assignment Sheet I (Due 20-Oct-2017) Assignment 1 Let n N and A be a finite set of cardinality n = A. By definition, a permutation of A is a bijective function from A to A. Prove that there exist
More informationKnow it. Control points. B Spline surfaces. Implicit surfaces
Know it 15 B Spline Cur 14 13 12 11 Parametric curves Catmull clark subdivision Parametric surfaces Interpolating curves 10 9 8 7 6 5 4 3 2 Control points B Spline surfaces Implicit surfaces Bezier surfaces
More information2D Spline Curves. CS 4620 Lecture 18
2D Spline Curves CS 4620 Lecture 18 2014 Steve Marschner 1 Motivation: smoothness In many applications we need smooth shapes that is, without discontinuities So far we can make things with corners (lines,
More informationCS 4620 Final Exam. (a) Is a circle C 0 continuous?
CS 4620 Final Exam Wednesday 9, December 2009 2 1 2 hours Prof. Doug James Explain your reasoning for full credit. You are permitted a double-sided sheet of notes. Calculators are allowed but unnecessary.
More informationSolution 2. ((3)(1) (2)(1), (4 3), (4)(2) (3)(3)) = (1, 1, 1) D u (f) = (6x + 2yz, 2y + 2xz, 2xy) (0,1,1) = = 4 14
Vector and Multivariable Calculus L Marizza A Bailey Practice Trimester Final Exam Name: Problem 1. To prepare for true/false and multiple choice: Compute the following (a) (4, 3) ( 3, 2) Solution 1. (4)(
More information05 - Surfaces. Acknowledgements: Olga Sorkine-Hornung. CSCI-GA Geometric Modeling - Daniele Panozzo
05 - Surfaces Acknowledgements: Olga Sorkine-Hornung Reminder Curves Turning Number Theorem Continuous world Discrete world k: Curvature is scale dependent is scale-independent Discrete Curvature Integrated
More informationSurfaces Reconstruction Via Inertial Sensors for Monitoring
Surfaces Reconstruction Via Inertial Sensors for Monitoring Nathalie Saguin-Sprynski, Laurent Jouanet, Bernard Lacolle, Luc Biard To cite this version: Nathalie Saguin-Sprynski, Laurent Jouanet, Bernard
More informationIsoparametric Curve of Quadratic F-Bézier Curve
J. of the Chosun Natural Science Vol. 6, No. 1 (2013) pp. 46 52 Isoparametric Curve of Quadratic F-Bézier Curve Hae Yeon Park 1 and Young Joon Ahn 2, Abstract In this thesis, we consider isoparametric
More informationLecture IV Bézier Curves
Lecture IV Bézier Curves Why Curves? Why Curves? Why Curves? Why Curves? Why Curves? Linear (flat) Curved Easier More pieces Looks ugly Complicated Fewer pieces Looks smooth What is a curve? Intuitively:
More informationNeed for Parametric Equations
Curves and Surfaces Curves and Surfaces Need for Parametric Equations Affine Combinations Bernstein Polynomials Bezier Curves and Surfaces Continuity when joining curves B Spline Curves and Surfaces Need
More informationThe Essentials of CAGD
The Essentials of CAGD Chapter 6: Bézier Patches Gerald Farin & Dianne Hansford CRC Press, Taylor & Francis Group, An A K Peters Book www.farinhansford.com/books/essentials-cagd c 2 Farin & Hansford The
More informationSurfaces for CAGD. FSP Tutorial. FSP-Seminar, Graz, November
Surfaces for CAGD FSP Tutorial FSP-Seminar, Graz, November 2005 1 Tensor Product Surfaces Given: two curve schemes (Bézier curves or B splines): I: x(u) = m i=0 F i(u)b i, u [a, b], II: x(v) = n j=0 G
More informationMA 323 Geometric Modelling Course Notes: Day 31 Blended and Ruled Surfaces Coons Patches
MA 323 Geometric Modelling Course Notes: Day 31 Blended and Ruled Surfaces Coons Patches David L. Finn Today, we want to start considering patches that are constructed solely by specifying the edge curves.
More information3D Modeling Parametric Curves & Surfaces
3D Modeling Parametric Curves & Surfaces Shandong University Spring 2012 3D Object Representations Raw data Point cloud Range image Polygon soup Solids Voxels BSP tree CSG Sweep Surfaces Mesh Subdivision
More informationLecture 2 September 3
EE 381V: Large Scale Optimization Fall 2012 Lecture 2 September 3 Lecturer: Caramanis & Sanghavi Scribe: Hongbo Si, Qiaoyang Ye 2.1 Overview of the last Lecture The focus of the last lecture was to give
More informationOptimal (local) Triangulation of Hyperbolic Paraboloids
Optimal (local) Triangulation of Hyperbolic Paraboloids Dror Atariah Günter Rote Freie Universität Berlin December 14 th 2012 Outline Introduction Taylor Expansion Quadratic Surfaces Vertical Distance
More informationA GENTLE INTRODUCTION TO THE BASIC CONCEPTS OF SHAPE SPACE AND SHAPE STATISTICS
A GENTLE INTRODUCTION TO THE BASIC CONCEPTS OF SHAPE SPACE AND SHAPE STATISTICS HEMANT D. TAGARE. Introduction. Shape is a prominent visual feature in many images. Unfortunately, the mathematical theory
More informationand the crooked shall be made straight, and the rough ways shall be made smooth; Luke 3:5
ecture 8: Knot Insertion Algorithms for B-Spline Curves and Surfaces and the crooked shall be made straight, and the rough ways shall be made smooth; uke 3:5. Motivation B-spline methods have several advantages
More informationInterpolating and approximating scattered 3D-data with hierarchical tensor product B-splines
Interpolating and approximating scattered 3D-data with hierarchical tensor product B-splines Günther Greiner Kai Hormann Abstract In this note we describe surface reconstruction algorithms based on optimization
More informationCHAPTER 6 Parametric Spline Curves
CHAPTER 6 Parametric Spline Curves When we introduced splines in Chapter 1 we focused on spline curves, or more precisely, vector valued spline functions. In Chapters 2 and 4 we then established the basic
More information3D Modeling Parametric Curves & Surfaces. Shandong University Spring 2013
3D Modeling Parametric Curves & Surfaces Shandong University Spring 2013 3D Object Representations Raw data Point cloud Range image Polygon soup Surfaces Mesh Subdivision Parametric Implicit Solids Voxels
More informationShape Control of Cubic H-Bézier Curve by Moving Control Point
Journal of Information & Computational Science 4: 2 (2007) 871 878 Available at http://www.joics.com Shape Control of Cubic H-Bézier Curve by Moving Control Point Hongyan Zhao a,b, Guojin Wang a,b, a Department
More informationSurfaces with rational chord length parameterization
Surfaces with rational chord length parameterization Bohumír Bastl 1, Bert Jüttler 2, Miroslav Lávička 1, and Zbyněk Šír1 1 University of West Bohemia, Faculty of Applied Sciences, Department of Mathematics,
More informationMATLAB. Advanced Mathematics and Mechanics Applications Using. Third Edition. David Halpern University of Alabama CHAPMAN & HALL/CRC
Advanced Mathematics and Mechanics Applications Using MATLAB Third Edition Howard B. Wilson University of Alabama Louis H. Turcotte Rose-Hulman Institute of Technology David Halpern University of Alabama
More informationMulti-Scale Free-Form Surface Description
Multi-Scale Free-Form Surface Description Farzin Mokhtarian, Nasser Khalili and Peter Yuen Centre for Vision Speech and Signal Processing Dept. of Electronic and Electrical Engineering University of Surrey,
More informationCurves and Surfaces. Shireen Elhabian and Aly A. Farag University of Louisville
Curves and Surfaces Shireen Elhabian and Aly A. Farag University of Louisville February 21 A smile is a curve that sets everything straight Phyllis Diller (American comedienne and actress, born 1917) Outline
More informationEuler s Theorem. Brett Chenoweth. February 26, 2013
Euler s Theorem Brett Chenoweth February 26, 2013 1 Introduction This summer I have spent six weeks of my holidays working on a research project funded by the AMSI. The title of my project was Euler s
More informationCS-184: Computer Graphics
CS-184: Computer Graphics Lecture #12: Curves and Surfaces Prof. James O Brien University of California, Berkeley V2007-F-12-1.0 Today General curve and surface representations Splines and other polynomial
More information09 - Designing Surfaces. CSCI-GA Computer Graphics - Fall 16 - Daniele Panozzo
9 - Designing Surfaces Triangular surfaces A surface can be discretized by a collection of points and triangles Each triangle is a subset of a plane Every point on the surface can be expressed as an affine
More information1. Suppose that the equation F (x, y, z) = 0 implicitly defines each of the three variables x, y, and z as functions of the other two:
Final Solutions. Suppose that the equation F (x, y, z) implicitly defines each of the three variables x, y, and z as functions of the other two: z f(x, y), y g(x, z), x h(y, z). If F is differentiable
More informationIain Claridge. Surface Curvature
Iain Claridge Surface Curvature Siddhartha Chaudhuri http://www.cse.iitb.ac.in/~cs749 Curves and surfaces in 3D For our purposes: A curve is a map α : ℝ ℝ3 a b I (or from some subset I of ℝ) α(a) α(b)
More informationAn introduction to interpolation and splines
An introduction to interpolation and splines Kenneth H. Carpenter, EECE KSU November 22, 1999 revised November 20, 2001, April 24, 2002, April 14, 2004 1 Introduction Suppose one wishes to draw a curve
More informationSUBDIVISION ALGORITHMS FOR MOTION DESIGN BASED ON HOMOLOGOUS POINTS
SUBDIVISION ALGORITHMS FOR MOTION DESIGN BASED ON HOMOLOGOUS POINTS M. Hofer and H. Pottmann Institute of Geometry Vienna University of Technology, Vienna, Austria hofer@geometrie.tuwien.ac.at, pottmann@geometrie.tuwien.ac.at
More informationCurves and Surfaces Computer Graphics I Lecture 10
15-462 Computer Graphics I Lecture 10 Curves and Surfaces Parametric Representations Cubic Polynomial Forms Hermite Curves Bezier Curves and Surfaces [Angel 10.1-10.6] September 30, 2003 Doug James Carnegie
More informationA1:Orthogonal Coordinate Systems
A1:Orthogonal Coordinate Systems A1.1 General Change of Variables Suppose that we express x and y as a function of two other variables u and by the equations We say that these equations are defining a
More informationFairing Scalar Fields by Variational Modeling of Contours
Fairing Scalar Fields by Variational Modeling of Contours Martin Bertram University of Kaiserslautern, Germany Abstract Volume rendering and isosurface extraction from three-dimensional scalar fields are
More information