DOCSLIB.ORG

Surface Mesh Generation in Parametric Space Using a Riemannian Surface Definition

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Surface Mesh Generation in Parametric Space Using a Riemannian Surface Definition International Journal of Fluid Machinery and Systems DOI: http://dx.doi.org/10.5293/IJFMS.2020.13.2.476 Vol. 13, No. 2, April-June 2020 ISSN (Online): 1882-9554 Original Paper Surface Mesh Generation in Parametric Space Using a Riemannian Surface Definition Cui Dai1, Zhaoxue Wang 1, Liang Dong2, Yiping Chen1, Junfeng Qiu1 1School of Energy & Power Engineering, Jiangsu University, Zhenjiang 212013, Jiangsu, China, [email protected], [email protected], [email protected], [email protected] 2Research Center of Fluid Machinery Engineering and Technology, Jiangsu University, Zhenjiang 212013, Jiangsu, China, [email protected] Abstract In order to solve the problem of generating distortion elements in the mapping from parameter space to real space, and the boundary coincidence of the mesh generated by the software quality, an approach for parametric surface mesh generation based on Riemannian metric, combined with Delaunay triangulation and AFT is proposed. In our algorithm, the boundary curves are discretized based on the proximity and curvature of the curves in the model after derivation the correlation of curve length between parametric space and real space. Background meshes of parametric space were generated by using improved AFT, and could improve the efficient of the algorithm and control element sizing and metric values. When background mesh of parametric space were refined, to counteract mapping distortion, the traditional Delaunay incremental insertion kernel is replaced by inserting the center of triangle circumscribed ellipse, and the algorithm for locating ellipse center and judging whether nodes within ellipse. In this paper, the details of the surface mesh generated by the algorithm are introduced in detail. The algorithm proposed in this paper has the characteristics of reliable algorithm, high mesh generation efficiency and mesh quality. Finally, the reliability of the proposed algorithm is verified by an example of surface mesh generation. Key words: Surface mesh generation; Riemannian metric; advancing front method; Delaunay triangulation; Background mesh 1. Introduction Surface mesh generation is one of the most difficult and yet important prerequisites of mesh generation in three dimensions. The surface mesh influences the volume mesh close to the boundary of the domain. The smoothness of the surface mesh, and the conformity of this mesh to the domain boundary, directly affects the quality of any further finite element simulation based on the mesh. The accuracy of the numerical solutions and the convergence of the computation scheme are strongly related to the quality of the underlying surface meshes [1] (Since surface meshes define external Received March 3 2020; accepted for publication April 9 2020: Review conducted by Xuelin Tang. (Paper number O20005k) Corresponding author: Dong Liang, [email protected] 476 and internal boundaries of computational domains where boundary conditions are imposed). There are two popular surface mesh generation methods [2]: direct method and indirect method. The indirect method is conceptually straightforward as a two-dimensional mesh is generated in the parametric domain and thus it is expected to be faster than the direct approach. In addition, Indirect method is strong the adaptiveness for complex curved-surface, so indirect method are among the most commonly used surface mesh generation. The problem with the methods is the generation of a mesh which conforms to the metric of the surface. In fact, they aimed to minimize the error in the polyhedral approximation of the surface indirectly in the parametric space without paying attention to the quality of the resulting mesh. The mesh in the parametric surface is usually anisotropic, due to the metric deformation from the surface to its parametric domain. Thus, for people in finite element computation, the problem is reduced to the generation of an anisotropic mesh in the parametric domain. Cuillière[3] developed automatic mesh generation procedures based on advancing front methods (AFT) and featuring a priori nodal density calculations, and focused on the discretization of 3D parametric surfaces with strong variations of curvature with respect to a nodal density function with steep gradients. This method can be more accurately calculate element distortion, but may not be so general. In [4], Delaunay method was extended to anisotropic context of 2D domains, and a Riemannian metric map is introduced to remedy the mapping distortion from object space to parametric domain. The algorithm is easier to implemented and efficient, but it doesn’t suit to the surface that differs very much from interior to the boundary. In [5], Guan presented a new mesh generation procedure which is suggested for the triangulation of general combined parametric surfaces using an advancing front approach and metric tensor. The calculation and interpolation method of arbitrary points in surface’s parametric space are detailed. Tristano [6] presented a method for meshing 3D parametric surfaces using the advancing front method with a Riemannian surface definition. The details of the creation of the metric map used to determine the amount of distortion of the elements in parametric space are given along with the details of an advancing front algorithm that utilizes the metric map. The method overcomes anomalies found in the warped parametric space and direct 3D methods. Borouchaki[7]presented an indirect method for meshing parametric surfaces conforming to a user-special size map. First, from the size specification, a Riemannian metric is defined so that the desired mesh is one with unit length edges with respect to the related Riemannian space (the so-called ‘unit mesh’). Then, based on the intrinsic properties of the surface, the Riemannian structure is induced into the parametric space. Finally, a unit mesh is generated completely inside the parametric space so that it conforms to the metric of the induced Riemannian structure. Experiments [8] prove that Riemannian metric has well effect on eliminating mapping distortion. If only Riemannian metric is reasonably defined, the quality of surface mesh in 2D parametric domain can be controlled. A significant amount of research has gone into meshing surfaces using a metric map with Delaunay triangulation or Advancing Front Technique independently. However, those mesh generation methods have their own disadvantages (for example, AFT cannot assure the quality of the generated mesh to meet the standards, Delaunay triangulation needs to look for the triangle with the biggest dimensionless radius in generating internal nodes, so can be time-consuming. In addition, they calculate the size and metric of the surface by calling related functions in the surface mesh generating process and tend to be slower and less robust. Little attention has been paid to the automatic generation of mesh size and metric functions on a background mesh simultaneously. Most this work is only devoted to the automatic generation of mesh size functions [9-11]. In order to strikes a balance between surface mesh quality and computational cost, this paper proposes an approach for parametric surface mesh generation based on Riemannian metric, combined with Delaunay triangulation and AFT. The control element sizing and metric values are provided in a set of discrete points (vertices of a background triangular mesh) covering the parametric domain. Those discrete points are generated by AFT. The interpolation on individual triangles of background control mesh is then used to approximate the relevant mesh control function in the rest of the parametric space. Delaunay triangulation is then used to refine the mesh of parametric domain. 477 2. Overall Algorithm In this section, the overall surface mesh generation scheme is presented. Algorithmic details for each of the major steps in this scheme will be presented later in the paper. More specifically, the proposed algorithm involves the following steps: Read geometry information on parametric surfaces, and determine the corresponding boundary curves. According to the boundary curves on discrete curves with given metrics, make out the coordinate of all discrete points（section 3.1）. According to the discrete results of parameter curves, generate background mesh by using improved AFT and store the metrics of all nodes（section 3.2）. Refine the parameter surfaces using Delaunay until the meshes meet the required quality（section 3.3）. Map the meshes onto surface physical spaces. The proposed algorithm can be used for both flat and curved surfaces. While curved surfaces require the use of a metric map, flat surfaces can use the identity matrix for the metric, provided an initial transformation of the three dimensional boundary nodes to the x-y plane is first accomplished. 3. Details of the Algorithm This section will define the metric and its uses. It will also describe the creation of the background mesh and the surface mesh that utilize the metric. 3.1 Definition of the metric Metric at a point: the metric tensor at a certain point P in 3D space that defines element size characteristics is a 3×3 matrix, M3p, which has the form [12] a b c 1 M== b d f e e e e e e T 3p 1 2 3 2 1 2 3 c f e 3 (1) where λi, ei(i=1, 2, 3) is the corresponding eigenvalue and eigenvector of Matrix M3p, and det(M3p)>0, λi>0. Metric specified on the surface: when parametric surface r (u, v) is meshed, the metric tensor of the surface itself and 3D points specialized by users need to be taken into account simultaneously. Then, we get the metric, Msp, at a certain point P on the surface, as follows τ1 τ ττν MMsp= 2 3 p () 1 2 ν 2 (2) rr ν = uv τ = r τ = r rr where 1 u , 2 v , uv and the notation of 2 indicates that only the first two lines and two columns of the matrix are considered. 3.2 Discretizing Boundary Curve Curve meshing is one of the main steps in the meshing process of planes, curved surface and volumes.
Load more

Recommended publications
  • Surface Integrals
    VECTOR CALCULUS 16.7 Surface Integrals In this section, we will learn about: Integration of different types of surfaces. PARAMETRIC SURFACES Suppose a surface S has a vector equation r(u, v) = x(u, v) i + y(u, v) j + z(u, v) k (u, v) D PARAMETRIC SURFACES •We first assume that the parameter domain D is a rectangle and we divide it into subrectangles Rij with dimensions ∆u and ∆v. •Then, the surface S is divided into corresponding patches Sij. •We evaluate f at a point Pij* in each patch, multiply by the area ∆Sij of the patch, and form the Riemann sum mn * f() Pij S ij ij11 SURFACE INTEGRAL Equation 1 Then, we take the limit as the number of patches increases and define the surface integral of f over the surface S as: mn * f( x , y , z ) dS lim f ( Pij ) S ij mn, S ij11 . Analogues to: The definition of a line integral (Definition 2 in Section 16.2);The definition of a double integral (Definition 5 in Section 15.1) . To evaluate the surface integral in Equation 1, we approximate the patch area ∆Sij by the area of an approximating parallelogram in the tangent plane. SURFACE INTEGRALS In our discussion of surface area in Section 16.6, we made the approximation ∆Sij ≈ |ru x rv| ∆u ∆v where: x y z x y z ruv i j k r i j k u u u v v v are the tangent vectors at a corner of Sij. SURFACE INTEGRALS Formula 2 If the components are continuous and ru and rv are nonzero and nonparallel in the interior of D, it can be shown from Definition 1—even when D is not a rectangle—that: fxyzdS(,,) f ((,))|r uv r r | dA uv SD SURFACE INTEGRALS This should be compared with the formula for a line integral: b fxyzds(,,) f (())|'()|rr t tdt Ca Observe also that: 1dS |rr | dA A ( S ) uv SD SURFACE INTEGRALS Example 1 Compute the surface integral x2 dS , where S is the unit sphere S x2 + y2 + z2 = 1.
    [Show full text]
  • 16.6 Parametric Surfaces and Their Areas
    CHAPTER 16. VECTOR CALCULUS 239 16.6 Parametric Surfaces and Their Areas Comments. On the next page we summarize some ways of looking at graphs in Calc I, Calc II, and Calc III, and pose a question about what comes next. 2 3 2 Definition. Let r : R ! R and let D ⊆ R . A parametric surface S is the set of all points hx; y; zi such that hx; y; zi = r(u; v) for some hu; vi 2 D. In other words, it's the set of points you get using x = some function of u; v y = some function of u; v z = some function of u; v Example 1. (a) Describe the surface z = −x2 − y2 + 2 over the region D : −1 ≤ x ≤ 1; −1 ≤ y ≤ 1 as a parametric surface. Graph it in MATLAB. (b) Describe the surface z = −x2 − y2 + 2 over the region D : x2 + y2 ≤ 1 as a parametric surface. Graph it in MATLAB. Solution: (a) In this case we \cheat": we already have z as a function of x and y, so anything we do to get rid of x and y will work x = u y = v z = −u2 − v2 + 2 −1 ≤ u ≤ 1; −1 ≤ v ≤ 1 [u,v]=meshgrid(linspace(-1,1,35)); x=u; y=v; z=2-u.^2-v.^2; surf(x,y,z) CHAPTER 16. VECTOR CALCULUS 240 How graphs look in different contexts: Pre-Calc, and Calc I graphs: Calc II parametric graphs: y = f(x) x = f(t), y = g(t) • 1 number gets plugged in (usually x) • 1 number gets plugged in (usually t) • 1 number comes out (usually y) • 2 numbers come out (x and y) • Graph is essentially one dimensional (if you zoom in enough it looks like a line, plus you only need • graph is essentially one dimensional (but we one number, x, to specify any location on the don't picture t at all) graph) • We need to picture the graph in two dimensional • We need to picture the graph in a two dimen- world.
    [Show full text]
  • Polynomial Curves and Surfaces
    Polynomial Curves and Surfaces Chandrajit Bajaj and Andrew Gillette September 8, 2010 Contents 1 What is an Algebraic Curve or Surface? 2 1.1 Algebraic Curves . .3 1.2 Algebraic Surfaces . .3 2 Singularities and Extreme Points 4 2.1 Singularities and Genus . .4 2.2 Parameterizing with a Pencil of Lines . .6 2.3 Parameterizing with a Pencil of Curves . .7 2.4 Algebraic Space Curves . .8 2.5 Faithful Parameterizations . .9 3 Triangulation and Display 10 4 Polynomial and Power Basis 10 5 Power Series and Puiseux Expansions 11 5.1 Weierstrass Factorization . 11 5.2 Hensel Lifting . 11 6 Derivatives, Tangents, Curvatures 12 6.1 Curvature Computations . 12 6.1.1 Curvature Formulas . 12 6.1.2 Derivation . 13 7 Converting Between Implicit and Parametric Forms 20 7.1 Parameterization of Curves . 21 7.1.1 Parameterizing with lines . 24 7.1.2 Parameterizing with Higher Degree Curves . 26 7.1.3 Parameterization of conic, cubic plane curves . 30 7.2 Parameterization of Algebraic Space Curves . 30 7.3 Automatic Parametrization of Degree 2 Curves and Surfaces . 33 7.3.1 Conics . 34 7.3.2 Rational Fields . 36 7.4 Automatic Parametrization of Degree 3 Curves and Surfaces . 37 7.4.1 Cubics . 38 7.4.2 Cubicoids . 40 7.5 Parameterizations of Real Cubic Surfaces . 42 7.5.1 Real and Rational Points on Cubic Surfaces . 44 7.5.2 Algebraic Reduction . 45 1 7.5.3 Parameterizations without Real Skew Lines . 49 7.5.4 Classification and Straight Lines from Parametric Equations . 52 7.5.5 Parameterization of general algebraic plane curves by A-splines .
    [Show full text]
  • Surface Normals and Tangent Planes
    Surface Normals and Tangent Planes Normal and Tangent Planes to Level Surfaces Because the equation of a plane requires a point and a normal vector to the plane, …nding the equation of a tangent plane to a surface at a given point requires the calculation of a surface normal vector. In this section, we explore the concept of a normal vector to a surface and its use in …nding equations of tangent planes. To begin with, a level surface U (x; y; z) = k is said to be smooth if the gradient U = Ux;Uy;Uz is continuous and non-zero at any point on the surface. Equivalently,r h we ofteni write U = Uxex + Uyey + Uzez r where ex = 1; 0; 0 ; ey = 0; 1; 0 ; and ez = 0; 0; 1 : Supposeh now thati r (t) =h x (ti) ; y (t) ; z (t) hlies oni a smooth surface U (x; y; z) = k: Applying the derivative withh respect to t toi both sides of the equation of the level surface yields dU d = k dt dt Since k is a constant, the chain rule implies that U v = 0 r where v = x0 (t) ; y0 (t) ; z0 (t) . However, v is tangent to the surface because it is tangenth to a curve on thei surface, which implies that U is orthogonal to each tangent vector v at a given point on the surface. r That is, U (p; q; r) at a given point (p; q; r) is normal to the tangent plane to r 1 the surface U(x; y; z) = k at the point (p; q; r).
    [Show full text]
  • Geodesic Methods for Shape and Surface Processing Gabriel Peyré, Laurent D
    Geodesic Methods for Shape and Surface Processing Gabriel Peyré, Laurent D. Cohen To cite this version: Gabriel Peyré, Laurent D. Cohen. Geodesic Methods for Shape and Surface Processing. Tavares, João Manuel R.S.; Jorge, R.M. Natal. Advances in Computational Vision and Medical Image Process- ing: Methods and Applications, Springer Verlag, pp.29-56, 2009, Computational Methods in Applied Sciences, Vol. 13, 10.1007/978-1-4020-9086-8. hal-00365899 HAL Id: hal-00365899 https://hal.archives-ouvertes.fr/hal-00365899 Submitted on 4 Mar 2009 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Geodesic Methods for Shape and Surface Processing Gabriel Peyr´eand Laurent Cohen Ceremade, UMR CNRS 7534, Universit´eParis-Dauphine, 75775 Paris Cedex 16, France {peyre,cohen}@ceremade.dauphine.fr, WWW home page: http://www.ceremade.dauphine.fr/{∼peyre/,∼cohen/} Abstract. This paper reviews both the theory and practice of the nu- merical computation of geodesic distances on Riemannian manifolds. The notion of Riemannian manifold allows to define a local metric (a symmet- ric positive tensor field) that encodes the information about the prob- lem one wishes to solve. This takes into account a local isotropic cost (whether some point should be avoided or not) and a local anisotropy (which direction should be preferred).
    [Show full text]
  • Math 314 Lecture #34 §16.7: Surface Integrals
    Math 314 Lecture #34 §16.7: Surface Integrals Outcome A: Compute the surface integral of a function over a parametric surface. Let S be a smooth surface described parametrically by ~r(u, v), (u, v) ∈ D, and suppose the domain of f(x, y, z) includes S. The surface integral of f over S with respect to surface area is ZZ ZZ f(x, y, z) dS = f(~r(u, v))k~ru × ~rvk dA. S D When S is a piecewise smooth surface, i.e., a finite union of smooth surfaces S1,S2,...,Sk, that intersect only along their boundaries, the surface integral of f over S with respect to surface area is ZZ ZZ ZZ ZZ f dS = f dS + f dS + ··· + f dS, S S1 S2 Sk where the dS in each double integral is evaluated according the the parametric description of Si. Example. A parametric description of a surface S is ~r(u, v) = hu2, u sin v, u cos vi, 0 ≤ u ≤ 1, 0 ≤ v ≤ π/2. Here is a rendering of this surface. Here ~ru = h2u, sin v, cos vi and ~rv = h0, u cos v, −u sin vi, so that ~i ~j ~k 2 2 ~ru × ~rv = 2u sin v cos v = h−u, 2u sin v, 2u cos vi, 0 u cos v −u sin v and (with u ≥ 0), √ √ 2 4 2 k~ru × ~rvk = u + 4u = u 1 + 4u . The surface integral of f(x, y, z) = yz over S with respect to surface area is ZZ Z 1 Z π/2 √ yz dS = (u2 sin v cos v)(u 1 + 4u2) dvdu S 0 0 Z 1 √ sin2 v π/2 = u3 1 + 4u2 du 0 2 0 1 Z 1 √ = u3 1 + 4u2 du.
    [Show full text]
  • (Paraboloid) Z = X 2 + Y2 + 1. (A) Param
    PP 35 : Parametric surfaces, surface area and surface integrals 1. Consider the surface (paraboloid) z = x2 + y2 + 1. (a) Parametrize the surface by considering it as a graph. (b) Show that r(r; θ) = (r cos θ; r sin θ; r2 + 1); r ≥ 0; 0 ≤ θ ≤ 2π is a parametrization of the surface. (c) Parametrize the surface in the variables z and θ using the cylindrical coordinates. 2. For each of the following surfaces, describe the intersection of the surface and the plane z = k for some k > 0; and the intersection of the surface and the plane y = 0. Further write the surfaces in parametrized form r(z; θ) using the cylindrical co-ordinates. (a) 4z = x2 + 2y2 (paraboloid) (b) z = px2 + y2 (cone) 2 2 2 x2 y2 2 (c) x + y + z = 9; z ≥ 0 (Upper hemi-sphere) (d) − 9 − 16 + z = 1; z ≥ 0. 3. Let S denote the surface obtained by revolving the curve z = 3 + cos y; 0 ≤ y ≤ 2π about the y-axis. Find a parametrization of S. 4. Parametrize the part of the sphere x2 + y2 + z2 = 16; −2 ≤ z ≤ 2 using the spherical co-ordinates. 5. Consider the circle (y − 5)2 + z2 = 9; x = 0. Let S be the surface (torus) obtained by revolving this circle about the z-axis. Find a parametric representation of S with the parameters θ and φ where θ and φ are described as follows. If (x; y; z) is any point on the surface then θ is the angle between the x-axis and the line joining (0; 0; 0) and (x; y; 0) and φ is the angle between the line joining (x; y; z) and the center of the moving circle (which contains (x; y; z)) with the xy-plane.
    [Show full text]
  • Lecture 35 : Surface Area; Surface Integrals
    1 Lecture 35 : Surface Area; Surface Integrals In the previous lecture we de¯ned the surface area a(S) of the parametric surface S, de¯ned by r(u; v) on T , by the double integral RR a(S) = k ru £ rv k dudv: (1) T We will now drive a formula for the area of a surface de¯ned by the graph of a function. Area of a surface de¯ned by a graph: Suppose a surface S is given by z = f(x; y); (x; y) 2 T , thatp is, S is the graph of the function f(x; y). (For example, S is the unit hemisphere de¯ned by z = 1 ¡ x2 ¡ y2 where (x; y) lies in the circular region T : x2 +y2 · 1.) Then S can be considered as a parametric surface de¯ned by: r(x; y) = xi + yj + f(x; y)k; (x; y) 2 T: In this case the surface area becomes RR q 2 2 a(S) = 1 + fx + fy dxdy: (2) T q 2 2 because k ru £ rv k = k ¡fxi ¡ fyj + k k = 1 + fx + fy . Example 1: Let us ¯nd the area of the surface of the portion of the sphere x2 + y2 + z2 = 4a2 2 2 that lies inside thep cylinder x + y = 2ax. Note that the sphere can be considered as a union of 2 2 2 two graphs: z = § 4ap¡ x ¡ y . We will use the formula given in (2) to evaluate the surface area. Let z = f(x; y) = 4a2 ¡ x2 ¡ y2. Then q q ¡x ¡y 2 2 4a2 fx = p ; fy = p and 1 + f + f = 2 2 2 : 4a2¡x2¡y2 4a2¡x2¡y2 x y 4a ¡x ¡y Let T be the projection of the surface z = f(x; y) on the xy-plane (see Figure 1).
    [Show full text]
  • Parametric Surfaces and Their Areas
    Learning Goals Parametric Surfaces Tangent Planes Surface Area Review Math 213 - Parametric Surfaces and their Areas Peter A. Perry University of Kentucky November 22, 2019 Peter A. Perry University of Kentucky Math 213 - Parametric Surfaces and their Areas Learning Goals Parametric Surfaces Tangent Planes Surface Area Review Reminders • Homework D1 is due on Friday of this week • Homework D2 is due on Monday of next week • Thanksgiving is coming! Peter A. Perry University of Kentucky Math 213 - Parametric Surfaces and their Areas Learning Goals Parametric Surfaces Tangent Planes Surface Area Review Unit IV: Vector Calculus Fundamental Theorem for Line Integrals Green’s Theorem Curl and Divergence Parametric Surfaces and their Areas Surface Integrals Stokes’ Theorem, I Stokes’ Theorem, II The Divergence Theorem Review Review Review Peter A. Perry University of Kentucky Math 213 - Parametric Surfaces and their Areas Learning Goals Parametric Surfaces Tangent Planes Surface Area Review Goals of the Day This lecture is about parametric surfaces. You’ll learn: • How to define and visualize parametric surfaces • How to find the tangent plane to a parametric surface at a point • How to compute the surface area of a parametric surface using double integrals Peter A. Perry University of Kentucky Math 213 - Parametric Surfaces and their Areas Learning Goals Parametric Surfaces Tangent Planes Surface Area Review Parametric Curves and Parametric Surfaces Parametric Curve Parametric Surface A parametric curve in R3 is given by A parametric surface in R3 is given by r(t) = x(t)i + y(t)j + z(t)k r(u, v) = x(u, v)i + y(u, v)j + z(u, v)k where a ≤ t ≤ b where (u, v) lie in a region D of the uv plane.
    [Show full text]
  • Lecture Notes on Minimal Surfaces
    Lecture Notes on Minimal Surfaces Emma Carberry, Kai Fung, David Glasser, Michael Nagle, Nizam Ordulu February 17, 2005 Contents 1 Introduction 9 2 A Review on Differentiation 11 2.1 Differentiation........................... 11 2.2 Properties of Derivatives . 13 2.3 Partial Derivatives . 16 2.4 Derivatives............................. 17 3 Inverse Function Theorem 19 3.1 Partial Derivatives . 19 3.2 Derivatives............................. 20 3.3 The Inverse Function Theorem . 22 4 Implicit Function Theorem 23 4.1 ImplicitFunctions. 23 4.2 ParametricSurfaces. 24 5 First Fundamental Form 27 5.1 TangentPlanes .......................... 27 5.2 TheFirstFundamentalForm . 28 5.3 Area ................................ 29 5 6 Curves 33 6.1 Curves as a map from R to Rn .................. 33 6.2 ArcLengthandCurvature . 34 7 Tangent Planes 37 7.1 Tangent Planes; Differentials of Maps Between Surfaces . 37 7.1.1 Tangent Planes . 37 7.1.2 Coordinates of w T (S) in the Basis Associated to ∈ p Parameterization x .................... 38 7.1.3 Differential of a (Differentiable) Map Between Surfaces 39 7.1.4 Inverse Function Theorem . 42 7.2 TheGeometryofGaussMap . 42 7.2.1 Orientation of Surfaces . 42 7.2.2 GaussMap ........................ 43 7.2.3 Self-Adjoint Linear Maps and Quadratic Forms . 45 8 Gauss Map I 49 8.1 “Curvature”ofaSurface . 49 8.2 GaussMap ............................ 51 9 Gauss Map II 53 9.1 Mean and Gaussian Curvatures of Surfaces in R3 ....... 53 9.2 GaussMapinLocalCoordinates . 57 10 Introduction to Minimal Surfaces I 59 10.1 Calculating the Gauss Map using Coordinates . 59 10.2 MinimalSurfaces . 61 11 Introduction to Minimal Surface II 63 11.1 Why a Minimal Surface is Minimal (or Critical) .
    [Show full text]
  • Parametric Surfaces and Surface Area
    Parametric Surfaces and Surface Area What to know: 1. Be able to parametrize standard surfaces, like the ones in the handout. 2. Be able to understand what a parametrized surface looks like (for this class, being able to answer a multiple choice question is enough). 3. Be able to find the equation of the tangent plane at a point of a parametric surface. 4. Be able to compute the surface area of a parametric surface. So far, we've described curves, that are one dimensional objects, and made sense of integrals on them. Our goal now is to talk about surfaces, that are, in a sense, the two dimensional analogue. So, roughly speaking, surfaces are two dimensional objects. As such, we can relate them with subsets of the plane, which are easier to understand. Our tool to do this is called a parametrization. Let's become more specific: Definition 1. A parametrization is a function from a domain D in the uv plane into R3, written as ~r(u; v) = hx(u; v); y(u; v); z(u; v)i where x = x(u; v), y = y(u; v) and z = z(u; v) are real valued continuous functions (usually differentiable, and often with additional assumptions). Those three real valued functions are called parametric equations. Definition 2. A parametric surface is the image of a domain D in the uv plane under a parametrization defined on D (that is, the set in R3 that we find once we feed the parameterization with all points in D). Let's see a familiar example: Example 1.
    [Show full text]
  • J + Z(U, V)K Is a Vector-Valued Function Defined on an Region D in the Uv-Plane and the Partial Derivatives of X, Y, and Z with Respect to U and V Are All Continuous
    Section 16.6 Parametric surfaces and their areas. We suppose that r(u, v)= x(u, v)i + y(u, v)j + z(u, v)k is a vector-valued function defined on an region D in the uv-plane and the partial derivatives of x, y, and z with respect to u and v are all continuous. The set of all points (x,y,z) ∈ R3, such that x = x(u, v), y = y(u, v) z = z(u, v) and (u, v) ∈ D, is called a parametric surface S with parametric equations x = x(u, v), y = y(u, v) z = z(u, v). Example 1. Find a parametric representation for the part of the elliptic paraboloid y =6 − 3x2 − 2z2 that lies to the right of the xz-plane. 1 In general, a surface given as the graph of the function z = f(x, y), can always be regarded as a parametric surface with parametric equations x = x, y = y z = f(x, y). Surfaces of revolution also can be represented parametrically. Let us consider the surface S obtained by rotating the curve y = f(x), a ≤ x ≤ b, about the x-axis, where f(x) ≥ 0 and f ′ is continuous. Let θ be the angle of rotation. If (x,y,z) is a point on S, then x = x y = f(x)cos θ z = f(x) sin θ The parameter domain is given by a ≤ x ≤ b, 0 ≤ θ ≤ 2π. Example 2. Find equation for the surface generated by rotating the curve x =4y2 − y4, −2 ≤ y ≤ 2, about the y-axis.
    [Show full text]