DOCSLIB.ORG

Curvature of Plane Curves What Is Arc Length Parametrization? Let 2 Γ :[A, B] ⊆ R → R , T 7→ Γ(S) = (X(S), Y(S)) Be a Nice Curve

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Curvature of Plane Curves What Is Arc Length Parametrization? Let 2 Γ :[A, B] ⊆ R → R , T 7→ Γ(S) = (X(S), Y(S)) Be a Nice Curve Curvature of Plane Curves What is arc length parametrization? Let 2 γ :[a; b] ⊆ R ! R ; t 7! γ(s) = (x(s); y(s)) be a nice curve. We define its arc length from t = a to t = b to be Z b jjγ0(t)jjdt: a We say that γ(s) is an arc length parametrization provided jjγ0(s)jj ≡ 1: We also call such a parametrized curve a unit speed curve. Let c : R ! R2; t 7! c(t) be a curve We can always (assuming that jjc0(t)jj never equals 0) construct an arc length parametrization for a curve. Define a function Z τ=t 0 s : R ! R; t 7! s; t 7! jjc(τ) jjdτ: τ=a Observe that ds = jjc0(t)jj: ( ) dt ♦ Define 2 γ : R ! R ; s ! γ(s) by γ ◦ s = c: We have the diagram R A A c s AA AA A 2 R γ / R Using the chain rule we have ds dc γ0(s) · = : dt dt dc ds 0 From equation ♦ we have that jj dt jj = dt : Hence jjγ jj ≡ 1: We say that a curve γ(s) that is an arclength parametrization is a unit speed curve. We have that the length of the curve from γ(a) to γ(b) is b − a for any a; b > a: Definition of Curvature We start with an arclength parametrized curve γ; so that jjγ0(s)jj ≡ 1: Hence we can write γ0(s) = (cos(θ(s)); sin(θ(s))) = t(s): The curvature is how fast the direction of the tangent vector changes, that is, the curvature is κ(s) = θ0(s): Notice that γ00(s) = θ0(s)(− sin(θ(s); cos(θ(s)) = θ0(s)n(s): 1 and that n(s) = (− sin(θ(s); cos(θ(s)) is a normal to the curve so that the two unit vectors (n(s); t(s)) form an orietnted basis of R2: From this we can see the difference between curvature that is positive and curvature that is negative. See the figure. Observe that the curvature is the area of the rectangle spanned by γ0(t) and γ00(t): Hence γ0(s) κ(s) = det : gamma00(s) A formula for the curvature of an arbitrarily (not arclength) parmetrized curve. Given c(t) we can theoretically construct a corresponding arc length parametrized curve γ(s): But only theoretically. How do we explicitly compute the curvature of c(t) in terms 0 00 ds of c (t); c (t); dt ? We use the diagram RO A A c s AA AA A 2 R γ / R The chain rule tells how to compute derivatives of c in terms of the derivatives of s and dγ dγ ds dc ds : We solve this relation to obtain ds in terms of dt and dt : We apply this idea a second d2γ d2c dc ds time to obtain ds2 in terms of dt2 ; dt ; dt : Applying the chain rule to γ ◦ s = c we obtain dγ ds dc = : (?) ds dt dt Differentiating this with respect to t; we obtain ds 2 d2s d2c γ00(s) + γ0(s) = : dt dt2 dt2 Using the relation replace γ0(s) with a multiple of c0(t) we find we have ds 2 dc d2c γ00(s) + α = : dt dt dt2 Solve for γ00(s) gives d2c dc 2 − β γ00(s) = dt dt ds 2 ( dt ) for an appropriate constant β: 2 We use the determinant formula for curvature. This gives 0 c0(t) 1 B ds C 0 B C −3 0 γ (s) B0 dt 1C ds c (t) κ(t) = 00 = det B C = det 00 : γ (s) B 00 0 C dt c (t) BBc (t) − βc (t)CC @@ ds 2 AA ( ) dt If c(t) = (x(t); y(t); this gives x0y00 − x00y0 κ = : (x02 + y02)3=2 Specializing more to the case of a curve y = f(x) which we parametrized by (x(t) = t; y(t)) we get y00 κ = ; (1 + y02)3=2 00 d2y . but y = dx2 : 3.
Load more

Recommended publications
  • INTRODUCTION to ALGEBRAIC GEOMETRY, CLASS 25 Contents 1
    INTRODUCTION TO ALGEBRAIC GEOMETRY, CLASS 25 RAVI VAKIL Contents 1. The genus of a nonsingular projective curve 1 2. The Riemann-Roch Theorem with Applications but No Proof 2 2.1. A criterion for closed immersions 3 3. Recap of course 6 PS10 back today; PS11 due today. PS12 due Monday December 13. 1. The genus of a nonsingular projective curve The definition I’m going to give you isn’t the one people would typically start with. I prefer to introduce this one here, because it is more easily computable. Definition. The tentative genus of a nonsingular projective curve C is given by 1 − deg ΩC =2g 2. Fact (from Riemann-Roch, later). g is always a nonnegative integer, i.e. deg K = −2, 0, 2,.... Complex picture: Riemann-surface with g “holes”. Examples. Hence P1 has genus 0, smooth plane cubics have genus 1, etc. Exercise: Hyperelliptic curves. Suppose f(x0,x1) is a polynomial of homo- geneous degree n where n is even. Let C0 be the affine plane curve given by 2 y = f(1,x1), with the generically 2-to-1 cover C0 → U0.LetC1be the affine 2 plane curve given by z = f(x0, 1), with the generically 2-to-1 cover C1 → U1. Check that C0 and C1 are nonsingular. Show that you can glue together C0 and C1 (and the double covers) so as to give a double cover C → P1. (For computational convenience, you may assume that neither [0; 1] nor [1; 0] are zeros of f.) What goes wrong if n is odd? Show that the tentative genus of C is n/2 − 1.(Thisisa special case of the Riemann-Hurwitz formula.) This provides examples of curves of any genus.
    [Show full text]
  • Algebraic Geometry Michael Stoll
    Introductory Geometry Course No. 100 351 Fall 2005 Second Part: Algebraic Geometry Michael Stoll Contents 1. What Is Algebraic Geometry? 2 2. Affine Spaces and Algebraic Sets 3 3. Projective Spaces and Algebraic Sets 6 4. Projective Closure and Affine Patches 9 5. Morphisms and Rational Maps 11 6. Curves — Local Properties 14 7. B´ezout’sTheorem 18 2 1. What Is Algebraic Geometry? Linear Algebra can be seen (in parts at least) as the study of systems of linear equations. In geometric terms, this can be interpreted as the study of linear (or affine) subspaces of Cn (say). Algebraic Geometry generalizes this in a natural way be looking at systems of polynomial equations. Their geometric realizations (their solution sets in Cn, say) are called algebraic varieties. Many questions one can study in various parts of mathematics lead in a natural way to (systems of) polynomial equations, to which the methods of Algebraic Geometry can be applied. Algebraic Geometry provides a translation between algebra (solutions of equations) and geometry (points on algebraic varieties). The methods are mostly algebraic, but the geometry provides the intuition. Compared to Differential Geometry, in Algebraic Geometry we consider a rather restricted class of “manifolds” — those given by polynomial equations (we can allow “singularities”, however). For example, y = cos x defines a perfectly nice differentiable curve in the plane, but not an algebraic curve. In return, we can get stronger results, for example a criterion for the existence of solutions (in the complex numbers), or statements on the number of solutions (for example when intersecting two curves), or classification results.
    [Show full text]
  • Trigonometry Cram Sheet
    Trigonometry Cram Sheet August 3, 2016 Contents 6.2 Identities . 8 1 Definition 2 7 Relationships Between Sides and Angles 9 1.1 Extensions to Angles > 90◦ . 2 7.1 Law of Sines . 9 1.2 The Unit Circle . 2 7.2 Law of Cosines . 9 1.3 Degrees and Radians . 2 7.3 Law of Tangents . 9 1.4 Signs and Variations . 2 7.4 Law of Cotangents . 9 7.5 Mollweide’s Formula . 9 2 Properties and General Forms 3 7.6 Stewart’s Theorem . 9 2.1 Properties . 3 7.7 Angles in Terms of Sides . 9 2.1.1 sin x ................... 3 2.1.2 cos x ................... 3 8 Solving Triangles 10 2.1.3 tan x ................... 3 8.1 AAS/ASA Triangle . 10 2.1.4 csc x ................... 3 8.2 SAS Triangle . 10 2.1.5 sec x ................... 3 8.3 SSS Triangle . 10 2.1.6 cot x ................... 3 8.4 SSA Triangle . 11 2.2 General Forms of Trigonometric Functions . 3 8.5 Right Triangle . 11 3 Identities 4 9 Polar Coordinates 11 3.1 Basic Identities . 4 9.1 Properties . 11 3.2 Sum and Difference . 4 9.2 Coordinate Transformation . 11 3.3 Double Angle . 4 3.4 Half Angle . 4 10 Special Polar Graphs 11 3.5 Multiple Angle . 4 10.1 Limaçon of Pascal . 12 3.6 Power Reduction . 5 10.2 Rose . 13 3.7 Product to Sum . 5 10.3 Spiral of Archimedes . 13 3.8 Sum to Product . 5 10.4 Lemniscate of Bernoulli . 13 3.9 Linear Combinations .
    [Show full text]
  • Study of Spiral Transition Curves As Related to the Visual Quality of Highway Alignment
    A STUDY OF SPIRAL TRANSITION CURVES AS RELA'^^ED TO THE VISUAL QUALITY OF HIGHWAY ALIGNMENT JERRY SHELDON MURPHY B, S., Kansas State University, 1968 A MJvSTER'S THESIS submitted in partial fulfillment of the requirements for the degree MASTER OF SCIENCE Department of Civil Engineering KANSAS STATE UNIVERSITY Manhattan, Kansas 1969 Approved by P^ajQT Professor TV- / / ^ / TABLE OF CONTENTS <2, 2^ INTRODUCTION 1 LITERATURE SEARCH 3 PURPOSE 5 SCOPE 6 • METHOD OF SOLUTION 7 RESULTS 18 RECOMMENDATIONS FOR FURTHER RESEARCH 27 CONCLUSION 33 REFERENCES 34 APPENDIX 36 LIST OF TABLES TABLE 1, Geonetry of Locations Studied 17 TABLE 2, Rates of Change of Slope Versus Curve Ratings 31 LIST OF FIGURES FIGURE 1. Definition of Sight Distance and Display Angle 8 FIGURE 2. Perspective Coordinate Transformation 9 FIGURE 3. Spiral Curve Calculation Equations 12 FIGURE 4. Flow Chart 14 FIGURE 5, Photograph and Perspective of Selected Location 15 FIGURE 6. Effect of Spiral Curves at Small Display Angles 19 A, No Spiral (Circular Curve) B, Completely Spiralized FIGURE 7. Effects of Spiral Curves (DA = .015 Radians, SD = 1000 Feet, D = l** and A = 10*) 20 Plate 1 A. No Spiral (Circular Curve) B, Spiral Length = 250 Feet FIGURE 8. Effects of Spiral Curves (DA = ,015 Radians, SD = 1000 Feet, D = 1° and A = 10°) 21 Plate 2 A. Spiral Length = 500 Feet B. Spiral Length = 1000 Feet (Conpletely Spiralized) FIGURE 9. Effects of Display Angle (D = 2°, A = 10°, Ig = 500 feet, = SD 500 feet) 23 Plate 1 A. Display Angle = .007 Radian B. Display Angle = .027 Radiaji FIGURE 10.
    [Show full text]
  • The Ordered Distribution of Natural Numbers on the Square Root Spiral
    The Ordered Distribution of Natural Numbers on the Square Root Spiral - Harry K. Hahn - Ludwig-Erhard-Str. 10 D-76275 Et Germanytlingen, Germany ------------------------------ mathematical analysis by - Kay Schoenberger - Humboldt-University Berlin ----------------------------- 20. June 2007 Abstract : Natural numbers divisible by the same prime factor lie on defined spiral graphs which are running through the “Square Root Spiral“ ( also named as “Spiral of Theodorus” or “Wurzel Spirale“ or “Einstein Spiral” ). Prime Numbers also clearly accumulate on such spiral graphs. And the square numbers 4, 9, 16, 25, 36 … form a highly three-symmetrical system of three spiral graphs, which divide the square-root-spiral into three equal areas. A mathematical analysis shows that these spiral graphs are defined by quadratic polynomials. The Square Root Spiral is a geometrical structure which is based on the three basic constants: 1, sqrt2 and π (pi) , and the continuous application of the Pythagorean Theorem of the right angled triangle. Fibonacci number sequences also play a part in the structure of the Square Root Spiral. Fibonacci Numbers divide the Square Root Spiral into areas and angle sectors with constant proportions. These proportions are linked to the “golden mean” ( golden section ), which behaves as a self-avoiding-walk- constant in the lattice-like structure of the square root spiral. Contents of the general section Page 1 Introduction to the Square Root Spiral 2 2 Mathematical description of the Square Root Spiral 4 3 The distribution
    [Show full text]
  • (Spiral Curves) When Transition Curves Are Not Provided, Drivers Tend To
    The Transition Curves (Spiral Curves) The transition curve (spiral) is a curve that has a varying radius. It is used on railroads and most modem highways. It has the following purposes: 1- Provide a gradual transition from the tangent (r=∞ )to a simple circular curve with radius R 2- Allows for gradual application of superelevation. Advantages of the spiral curves: 1- Provide a natural easy to follow path such that the lateral force increase and decrease gradually as the vehicle enters and leaves the circular curve 2- The length of the transition curve provides a suitable location for the superelevation runoff. 3- The spiral curve facilitate the transition in width where the travelled way is widened on circular curve. 4- The appearance of the highway is enhanced by the application of spiral curves. When transition curves are not provided, drivers tend to create their own transition curves by moving laterally within their travel lane and sometimes the adjoining lane, which is risky not only for them but also for other road users. Minimum length of spiral. Minimum length of spiral is based on consideration of driver comfort and shifts in the lateral position of vehicles. It is recommended that these two criteria be used together to determine the minimum length of spiral. Thus, the minimum spiral length can be computed as: Ls, min should be the larger of: , , . Ls,min = minimum length of spiral, m; Pmin = minimum lateral offset (shift) between the tangent and circular curve (0.20 m); R = radius of circular curve, m; V = design speed, km/h; C = maximum rate of change in lateral acceleration (1.2 m/s3) Maximum length of spiral.
    [Show full text]
  • A Gallery of De Rham Curves
    A Gallery of de Rham Curves Linas Vepstas <[email protected]> 20 August 2006 Abstract The de Rham curves are a set of fairly generic fractal curves exhibiting dyadic symmetry. Described by Georges de Rham in 1957[3], this set includes a number of the famous classical fractals, including the Koch snowflake, the Peano space- filling curve, the Cesàro-Faber curves, the Takagi-Landsberg[4] or blancmange curve, and the Lévy C-curve. This paper gives a brief review of the construction of these curves, demonstrates that the complete collection of linear affine deRham curves is a five-dimensional space, and then presents a collection of four dozen images exploring this space. These curves are interesting because they exhibit dyadic symmetry, with the dyadic symmetry monoid being an interesting subset of the group GL(2,Z). This is a companion article to several others[5][6] exploring the nature of this monoid in greater detail. 1 Introduction In a classic 1957 paper[3], Georges de Rham constructs a class of curves, and proves that these curves are everywhere continuous but are nowhere differentiable (more pre- cisely, are not differentiable at the rationals). In addition, he shows how the curves may be parameterized by a real number in the unit interval. The construction is simple. This section illustrates some of these curves. 2 2 2 2 Consider a pair of contracting maps of the plane d0 : R → R and d1 : R → R . By the Banach fixed point theorem, such contracting maps should have fixed points p0 and p1. Assume that each fixed point lies in the basin of attraction of the other map, and furthermore, that the one map applied to the fixed point of the other yields the same point, that is, d1(p0) = d0(p1) (1) These maps can then be used to construct a certain continuous curve between p0and p1.
    [Show full text]
  • Chapter 2. Parameterized Curves in R3
    Chapter 2. Parameterized Curves in R3 Def. A smooth curve in R3 is a smooth map σ :(a, b) → R3. For each t ∈ (a, b), σ(t) ∈ R3. As t increases from a to b, σ(t) traces out a curve in R3. In terms of components, σ(t) = (x(t), y(t), z(t)) , (1) or x = x(t) σ : y = y(t) a < t < b , z = z(t) dσ velocity at time t: (t) = σ0(t) = (x0(t), y0(t), z0(t)) . dt dσ speed at time t: (t) = |σ0(t)| dt Ex. σ : R → R3, σ(t) = (r cos t, r sin t, 0) - the standard parameterization of the unit circle, x = r cos t σ : y = r sin t z = 0 σ0(t) = (−r sin t, r cos t, 0) |σ0(t)| = r (constant speed) 1 Ex. σ : R → R3, σ(t) = (r cos t, r sin t, ht), r, h > 0 constants (helix). σ0(t) = (−r sin t, r cos t, h) √ |σ0(t)| = r2 + h2 (constant) Def A regular curve in R3 is a smooth curve σ :(a, b) → R3 such that σ0(t) 6= 0 for all t ∈ (a, b). That is, a regular curve is a smooth curve with everywhere nonzero velocity. Ex. Examples above are regular. Ex. σ : R → R3, σ(t) = (t3, t2, 0). σ is smooth, but not regular: σ0(t) = (3t2, 2t, 0) , σ0(0) = (0, 0, 0) Graph: x = t3 y = t2 = (x1/3)2 σ : y = t2 ⇒ y = x2/3 z = 0 There is a cusp, not because the curve isn’t smooth, but because the velocity = 0 at the origin.
    [Show full text]
  • CURVATURE E. L. Lady the Curvature of a Curve Is, Roughly Speaking, the Rate at Which That Curve Is Turning. Since the Tangent L
    1 CURVATURE E. L. Lady The curvature of a curve is, roughly speaking, the rate at which that curve is turning. Since the tangent line or the velocity vector shows the direction of the curve, this means that the curvature is, roughly, the rate at which the tangent line or velocity vector is turning. There are two refinements needed for this definition. First, the rate at which the tangent line of a curve is turning will depend on how fast one is moving along the curve. But curvature should be a geometric property of the curve and not be changed by the way one moves along it. Thus we define curvature to be the absolute value of the rate at which the tangent line is turning when one moves along the curve at a speed of one unit per second. At first, remembering the determination in Calculus I of whether a curve is curving upwards or downwards (“concave up or concave down”) it may seem that curvature should be a signed quantity. However a little thought shows that this would be undesirable. If one looks at a circle, for instance, the top is concave down and the bottom is concave up, but clearly one wants the curvature of a circle to be positive all the way round. Negative curvature simply doesn’t make sense for curves. The second problem with defining curvature to be the rate at which the tangent line is turning is that one has to figure out what this means. The Curvature of a Graph in the Plane.
    [Show full text]
  • Chapter 13 Curvature in Riemannian Manifolds
    Chapter 13 Curvature in Riemannian Manifolds 13.1 The Curvature Tensor If (M, , )isaRiemannianmanifoldand is a connection on M (that is, a connection on TM−), we− saw in Section 11.2 (Proposition 11.8)∇ that the curvature induced by is given by ∇ R(X, Y )= , ∇X ◦∇Y −∇Y ◦∇X −∇[X,Y ] for all X, Y X(M), with R(X, Y ) Γ( om(TM,TM)) = Hom (Γ(TM), Γ(TM)). ∈ ∈ H ∼ C∞(M) Since sections of the tangent bundle are vector fields (Γ(TM)=X(M)), R defines a map R: X(M) X(M) X(M) X(M), × × −→ and, as we observed just after stating Proposition 11.8, R(X, Y )Z is C∞(M)-linear in X, Y, Z and skew-symmetric in X and Y .ItfollowsthatR defines a (1, 3)-tensor, also denoted R, with R : T M T M T M T M. p p × p × p −→ p Experience shows that it is useful to consider the (0, 4)-tensor, also denoted R,givenby R (x, y, z, w)= R (x, y)z,w p p p as well as the expression R(x, y, y, x), which, for an orthonormal pair, of vectors (x, y), is known as the sectional curvature, K(x, y). This last expression brings up a dilemma regarding the choice for the sign of R. With our present choice, the sectional curvature, K(x, y), is given by K(x, y)=R(x, y, y, x)but many authors define K as K(x, y)=R(x, y, x, y). Since R(x, y)isskew-symmetricinx, y, the latter choice corresponds to using R(x, y)insteadofR(x, y), that is, to define R(X, Y ) by − R(X, Y )= + .
    [Show full text]
  • TABLES of CURVES with MANY POINTS Introduction in Recent Years
    MATHEMATICS OF COMPUTATION Volume 69, Number 230, Pages 797{810 S 0025-5718(99)01143-6 Article electronically published on August 18, 1999 TABLES OF CURVES WITH MANY POINTS GERARD VAN DER GEER AND MARCEL VAN DER VLUGT Abstract. These tables record results on curves with many points over finite fields. For relatively small genus (0 ≤ g ≤ 50) and q asmallpowerof2or3we give in two tables the best presently known bounds for Nq(g), the maximum number of rational points on a smooth absolutely irreducible projective curve of genus g over a field Fq of cardinality q. In additional tables we list for a given pair (g; q) the type of construction of the best curve so far, and we give a reference to the literature where such a curve can be found. Introduction In recent years the question of how many points a curve of genus g over a finite field Fq can have has attracted a lot of attention. This was motivated partly by possible applications in coding theory and cryptography, but also by the fact that the question represents an attractive mathematical challenge. It is well known that a smooth absolutely irreducible projectivep curve of genus g over a finite field Fq can possess at most q +1+2g q rational points. By a curve we shall mean in this paper a smooth absolutely irreducible projective curve defined over a finite field. The bound mentioned is the celebrated Hasse-Weil bound, proved by Hasse for g = 1 and by Weil in general. We denote by Nq(g)the maximum number of rational points on a curve of genus g over Fq.
    [Show full text]
  • Curvature of Riemannian Manifolds
    Curvature of Riemannian Manifolds Seminar Riemannian Geometry Summer Term 2015 Prof. Dr. Anna Wienhard and Dr. Gye-Seon Lee Soeren Nolting July 16, 2015 1 Motivation Figure 1: A vector parallel transported along a closed curve on a curved manifold.[1] The aim of this talk is to define the curvature of Riemannian Manifolds and meeting some important simplifications as the sectional, Ricci and scalar curvature. We have already noticed, that a vector transported parallel along a closed curve on a Riemannian Manifold M may change its orientation. Thus, we can determine whether a Riemannian Manifold is curved or not by transporting a vector around a loop and measuring the difference of the orientation at start and the endo of the transport. As an example take Figure 1, which depicts a parallel transport of a vector on a two-sphere. Note that in a non-curved space the orientation of the vector would be preserved along the transport. 1 2 Curvature In the following we will use the Einstein sum convention and make use of the notation: X(M) space of smooth vector fields on M D(M) space of smooth functions on M 2.1 Defining Curvature and finding important properties This rather geometrical approach motivates the following definition: Definition 2.1 (Curvature). The curvature of a Riemannian Manifold is a correspondence that to each pair of vector fields X; Y 2 X (M) associates the map R(X; Y ): X(M) ! X(M) defined by R(X; Y )Z = rX rY Z − rY rX Z + r[X;Y ]Z (1) r is the Riemannian connection of M.
    [Show full text]