• Title/Summary/Keyword: tangent curves

Search Result 55, Processing Time 0.023 seconds

A study on tangent of quadratic curves and cycloid curves using vectors (벡터를 활용한 이차곡선과 사이클로이드의 접선에 대한 연구)

  • Lee, Dong Won;Chung, Young Woo;Kim, Boo Yoon
    • The Mathematical Education
    • /
    • v.53 no.3
    • /
    • pp.313-327
    • /
    • 2014
  • 'Tangent' is one of the most important concepts in the middle and high school mathematics, especially in dealing with calculus. The concept of tangent in the current textbook consists of the ways which make use of discriminant or differentiation. These ways, however, do not present dynamic view points, that is, the concept of variation. In this paper, after applying 'Roberval's way of finding tangent using vectors in terms of kinematics to parabola, ellipse, circle, hyperbola, cycloid, hypocycloid and epicycloid, we will identify that this is the tangent of those curves. This trial is the educational link of mathematics and physics, and it will also suggest the appropriate example of applying vector. We will also help students to understand the tangent by connecting this method to the existing ones.

Constructing $G^1$ Quadratic B$\acute{e}$zier Curves with Arbitrary Endpoint Tangent Vectors

  • Gu, He-Jin;Yong, Jun-Hai;Paul, Jean-Claude;Cheng, Fuhua (Frank)
    • International Journal of CAD/CAM
    • /
    • v.9 no.1
    • /
    • pp.55-60
    • /
    • 2010
  • Quadratic B$\acute{e}$zier curves are important geometric entities in many applications. However, it was often ignored by the literature the fact that a single segment of a quadratic B$\acute{e}$zier curve may fail to fit arbitrary endpoint unit tangent vectors. The purpose of this paper is to provide a solution to this problem, i.e., constructing $G^1$ quadratic B$\acute{e}$zier curves satisfying given endpoint (positions and arbitrary unit tangent vectors) conditions. Examples are given to illustrate the new solution and to perform comparison between the $G^1$ quadratic B$\acute{e}$zier cures and other curve schemes such as the composite geometric Hermite curves and the biarcs.

A Tetrahedral Decomposition Method for Computing Tangent Curves of 3D Vector Fields (3차원 벡터필드 탄젠트 곡선 계산을 위한 사면체 분해 방법)

  • Jung, Il-Hong
    • Journal of Digital Contents Society
    • /
    • v.16 no.4
    • /
    • pp.575-581
    • /
    • 2015
  • This paper presents the development of certain highly efficient and accurate method for computing tangent curves for three-dimensional vector fields. Unlike conventional methods, such as Runge-Kutta method, for computing tangent curves which produce only approximations, the method developed herein produces exact values on the tangent curves based upon piecewise linear variation over a tetrahedral domain in 3D. This new method assumes that the vector field is piecewise linearly defined over a tetrahedron in 3D domain. It is also required to decompose the hexahedral cell into five or six tetrahedral cells for three-dimensional vector fields. The critical points can be easily found by solving a simple linear system for each tetrahedron. This method is to find exit points by producing a sequence of points on the curve with the computation of each subsequent point based on the previous. Because points on the tangent curves are calculated by the explicit solution for each tetrahedron, this new method provides correct topology in visualizing 3D vector fields.

An Efficient Visualization Method of Two-Dimensional Vector Fields (2차원 벡터 필드의 효율적인 가시화 방법)

  • Jung, Il-Hong
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.11
    • /
    • pp.1623-1628
    • /
    • 2009
  • This paper presents the development of certain highly efficient and accurate method for computing tangent curves for two-dimensional vector fields. Unlike convention methods, such as Runge-Kutta, for computing tangent curves which produce only approximations, the method developed herein produces exact values on the tangent curves based on piecewise linear variation over a triangle in 2D. This new method assumes that the vector field is piecewise linearly defined over a triangle in 2D. It is also required to decompose the rectangular cell into two triangular cells. The critical points can be easily found by solving a simple linear system for each triangle. This method is to find exit points by producing a sequence of points on the curve with the computation of each subsequent point based on the previous. Because points on the tangent curves are calculated by the explicit solution for each triangle, this new method provides correct topologies in visualizing 2D vector fields.

  • PDF

VISUAL CURVATURE FOR SPACE CURVES

  • JEON, MYUNGJIN
    • Honam Mathematical Journal
    • /
    • v.37 no.4
    • /
    • pp.487-504
    • /
    • 2015
  • For a smooth plane curve, the curvature can be characterized by the rate of change of the angle between the tangent vector and a fixed vector. In this article we prove that the curvature of a space curve can also be given by the rate of change of the locally defined angle between the tangent vector at a point and the nearby point. By using height functions, we introduce turning angle of a space curve and characterize the curvature by the rate of change of the turning angle. The main advantage of the turning angle is that it can be used to characterize the curvature of discrete curves. For this purpose, we introduce a discrete turning angle and a discrete curvature called visual curvature for space curves. We can show that the visual curvature is an approximation of curvature for smooth curves.

Convexity preserving piecewise rational interpolation for planar curves

  • Sarfraz, Muhammad
    • Bulletin of the Korean Mathematical Society
    • /
    • v.29 no.2
    • /
    • pp.193-200
    • /
    • 1992
  • This paper uses a piecewise ratonal cubic interpolant to solve the problem of shape preserving interpolation for plane curves; scalar curves are also considered as a special case. The results derived here are actually the extensions of the convexity preserving results of Delbourgo and Gregory [Delbourgo and Gregory'85] who developed a $C^{1}$ shape preserving interpolation scheme for scalar curves using the same piecewise rational function. They derived the ocnstraints, on the shape parameters occuring in the rational function under discussion, to make the interpolant preserve the convex shape of the data. This paper begins with some preliminaries about the rational cubic interpolant. The constraints consistent with convex data, are derived in Sections 3. These constraints are dependent on the tangent vectors. The description of the tangent vectors, which are consistent and dependent on the given data, is made in Section 4. the convexity preserving results are explained with examples in Section 5.

  • PDF

Approximation of Curves with Biarcs using Tangent (탄젠트를 이용한 biarc로의 곡선 근사화)

  • 방주영;김재정
    • Korean Journal of Computational Design and Engineering
    • /
    • v.5 no.2
    • /
    • pp.168-174
    • /
    • 2000
  • A biarc is a curve connecting two circular arcs with the constraints of tangent continuity so that it can represent the free form currie approximately connecting several biarcs with the tangent continuity. Since a biarc consists of circular arcs, the offset curve of the curve represented by biarcs can be easily obtained. Besides. if the tool path is represented by biarcs, the efficiency of machining is improved and the amount of data is decreased. When approximating a curve with biarcs, the location of the point where two circular arcs meet each other plays an important part in determining the shape of a biarc. In this thesis, the optimum point where two circular arcs meet is calculated using the tangent information of the curve to approximate so that it takes less calculation time to approximate due to the decrease of the number of iterations.

  • PDF

DOUBLE COVERS OF PLANE CURVES OF DEGREE SIX WITH ALMOST TOTAL FLEXES

  • Kim, Seon Jeong;Komeda, Jiryo
    • Bulletin of the Korean Mathematical Society
    • /
    • v.56 no.5
    • /
    • pp.1159-1186
    • /
    • 2019
  • In this paper, we study plane curves of degree 6 with points whose multiplicities of the tangents are 5. We determine all the Weierstrass semigroups of ramification points on double covers of the plane curves when the genera of the covering curves are greater than 29 and the ramification points are on the points with multiplicity 5 of the tangent.

Teaching and Learning Concepts of Tangent in School Mathematics (학교 수학에서 접선 개념 교수 방안 연구)

  • 임재훈;박교식
    • Journal of Educational Research in Mathematics
    • /
    • v.14 no.2
    • /
    • pp.171-185
    • /
    • 2004
  • Students are exposed to a concept of tangent from a specific context of the relation between a circle and straight lines at the 7th grade. This initial experience might cause epistemological obstacles regarding learning concepts of tangent to additional curves. The paper provides a method of how to introduce a series of concepts of tangent in order to lead students to revise and improve the concept of tangent which they have. As students have chance to reflect and revise a series of concepts of tangent step by step, they realize the facts that the properties such as 'meeting the curve at one point' and 'touching but not cutting the curve' may be regarded as the proper definition of tangent in some limited contexts but are not essential in more general contexts. And finally students can grasp and appreciate that concept of tangent as the limit of secants and the relation between tangent and derivative.

  • PDF

SCALED VISUAL CURVATURE AND VISUAL FRENET FRAME FOR SPACE CURVES

  • Jeon, Myungjin
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.34 no.1
    • /
    • pp.37-53
    • /
    • 2021
  • In this paper we define scaled visual curvature and visual Frenet frame that can be visually accepted for discrete space curves. Scaled visual curvature is relatively simple compared to multi-scale visual curvature and easy to control the influence of noise. We adopt scaled minimizing directions of height functions on each neighborhood. Minimizing direction at a point of a curve is a direction that makes the point a local minimum. Minimizing direction can be given by a small noise around the point. To reduce this kind of influence of noise we exmine the direction whether it makes the point minimum in a neighborhood of some size. If this happens we call the direction scaled minimizing direction of C at p ∈ C in a neighborhood Br(p). Normal vector of a space curve is a second derivative of the curve but we characterize the normal vector of a curve by an integration of minimizing directions. Since integration is more robust to noise, we can find more robust definition of discrete normal vector, visual normal vector. On the other hand, the set of minimizing directions span the normal plane in the case of smooth curve. So we can find the tangent vector from minimizing directions. This lead to the definition of visual tangent vector which is orthogonal to the visual normal vector. By the cross product of visual tangent vector and visual normal vector, we can define visual binormal vector and form a Frenet frame. We examine these concepts to some discrete curve with noise and can see that the scaled visual curvature and visual Frenet frame approximate the original geometric invariants.