Algorithms for Trigonometric Curves (Simplification, Implicitization, Parameterization)

  title={Algorithms for Trigonometric Curves (Simplification, Implicitization, Parameterization)},
  author={Hoon Hong and Josef Schicho},
  journal={J. Symb. Comput.},
  • H. Hong, J. Schicho
  • Published 1 September 1998
  • Mathematics, Computer Science
  • J. Symb. Comput.
A trigonometric curve is a real plane curve where each coordinate is given parametrically by a truncated Fourier series. The trigonometric curves frequently arise in various areas of mathematics, physics, and engineering. Some trigonometric curves can also be represented implicitly by bivariate polynomial equations. In this paper, we give algorithms for (a) simplifying a given parametric representation, (b) computing an implicit representation from a given parametric representation, and (c… 
Affine Equivalences of Trigonometric Curves
An efficient algorithm to detect whether two given trigonometric curves, in any dimension, are affinely equivalent, i.e. whether there exists an affine mapping transforming one of the curves onto the other, is provided.
Numerical Implicitization of Parametric Hypersurfaces with Linear Algebra
The method is applicable for polynomial, rational as well as trigonometric parametric representations and can also handle monoparametric families of parametric curves, surfaces and hypersurfaces with a small additional amount of human interaction.
A cyclic basis for closed curve and surface modeling
Quantifier Elimination for Trigonometric Polynomials by Cylindrical Trigonometric Decomposition
Given a formula ? in r variables, some of them quantified and/or occurring as arguments in trigonometric functions, we consider in this paper the problem of finding a quantifier-free formula
Detecting Symmetries of Rational Plane Curves
This work addresses the problem of deterministically detecting whether the curve exhibits some kind of symmetry, and of computing the elements of the symmetry in the armative case, and provides eective methods for solving these questions without any conversion to implicit form.
Hybrid Trigonometric Varieties
In this paper we introduce the notion of hybrid trigonometric parametrization as a tuple of real rational expressions involving circular and hyperbolic trigonometric functions as well as monomials,
Approximate Implicitization Using Cubic Bezier Segments
In this paper, an approximate implicitization technique is presented and the given parametric curve representation is approximated by means of cubic Bezier segments, which is a common requirement for many applications.
Optimal Reparametrization of Polynomial Algebraic Curves
It is proved that if is polynomial over , then Weil's descente variety associated with is surprisingly simple; it is, in fact, a line.


Implicitization of Curves Parameterized by Generalized Trigonometric Polynomials
An implicitization of the curve is obtained, that is, an equation in x and y which captures all the points on the curve and, if any, only finitely many more points.
Symbolic Parametrization of Curves
Rational curves with polynomial parameterization
Improperly parametrized rational curves
  • T. Sederberg
  • Computer Science, Mathematics
    Comput. Aided Geom. Des.
  • 1986
Algebraic geometry for scientists and engineers
Rational and polynomial parametrizations Fractional linear transformations Cubic curves Cubic surfaces and general hypersurfaces Outline of the theory of plane curves Affine plane and projective
Real Reparametrizations of Real Curves
The solution to both problems is given here by a simple algorithm, requiring essentially just a gcd computation and a parametrization of a real line or circle.
Rational Parametrization of Surfaces
An algorithm is given that decides if a parametrization of an implicitly given surface exists, based on Castelnuovo's rationality criterion, and if the answer is yes, then such a parametric representation is computed using the concept of adjoint functions.
Rational Parametrizations of Algebraic Curves Using a Canonical Divisor
An algorithm that uses an integral basis for computing L (D) for a suitably chosenD and shows how to construct a rational point onC2, which means defined without algebraic extensions, ofC2.