相关论文: A new method to compute the singularities of offse…

It is well known that an implicit equation of the offset to a rational planar curve can be computed by removing the extraneous components of the resultant of two certain polynomials computed from the parametrization of the curve.…

We consider the parameterization ${\mathbf{f}}=(f_0,f_1,f_2)$ of a plane rational curve $C$ of degree $n$, and we want to study the singularities of $C$ via such parameterization. We do this by using the projection from the rational normal…

In this paper we provide a computational approach to the shape of curves which are rational in polar coordinates, i.e. which are defined by means of a parametrization (r(t),\theta(t)) where both r(t),\theta(t) are rational functions. Our…

It is well known that an irreducible algebraic curve is rational (i.e. parametric) if and only if its genus is zero. In this paper, given a tolerance $\epsilon>0$ and an $\epsilon$-irreducible algebraic affine plane curve $\mathcal C$ of…

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…

In this paper we present algorithms for computing the topology of planar and space rational curves defined by a parametrization. The algorithms given here work directly with the parametrization of the curve, and do not require to compute or…

We give a complete factorization of the invariant factors of resultant matrices built from birational parameterizations of rational plane curves in terms of the singular points of the curve and their multiplicity graph. This allows us to…

In this paper we present several formulae for computing the partial degrees of the defining polynomial of the offset curve to an irreducible affine plane curve given implicitly, and we see how these formulae particularize to the case of…

Two curves are affinely equivalent if there exists an affine mapping transforming one of them onto the other. Thus, detecting affine equivalence comprises, as important particular cases, similarity, congruence and symmetry detection. In…

The non-uniqueness of a rational parametrization of a rational plane curve may influence the process of computing envelopes of 1-parameter families of plane curves. We study envelopes of family of circles centred on a regular trifolium and…

For affine algebraic plane curves we reduce a calculation of its invariants to calculation of the intersection of kernels of some derivations.

This paper is concerned with exact real solving of well-constrained, bivariate polynomial systems. The main problem is to isolate all common real roots in rational rectangles, and to determine their intersection multiplicities. We present…

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…

In this paper we present an algorithm to compute the (real and complex) straight lines contained in a rational surface, defined by a rational parameterization. The algorithm relies on the well-known theorem of Differential Geometry that…

We present a new algorithm for reconstructing an exact algebraic number from its approximate value using an improved parameterized integer relation construction method. Our result is consistent with the existence of error controlling on…

Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate…

Rational algebraic curves have been intensively studied in the last decades, both from the theoretical and applied point of view. In applications (e.g. level curves, linear homotopy deformation, geometric constructions in computer aided…

This paper addresses the problem of determining the symmetries of a plane or space curve defined by a rational parametrization. We provide effective methods to compute the involution and rotation symmetries for the planar case. As for space…

Offset curves for planar trajectories are interesting in the generation of tool paths for numerically controlled industrial machines and in trajectory planning methods for autonomous driving systems. Theoretical offset curves may exhibit…

We present the technique of parametrization of plane algebraic curves from a number theorist's point of view and present Kapferer's simple and beautiful (but little known) proof that nonsingular curves of degree > 2 cannot be parametrized…