Design and implementation of symbolic algorithms for the computation of generalized asymptotes

In this paper we present two algorithms for computing the g-asymptotes or generalized asymptotes, of a plane algebraic curve, \(\mathscr {C}\), implicitly or parametrically defined. The asymptotes of a curve \(\mathscr {C}\) reflect the status of \(\mathscr {C}\) at points with sufficiently large coordinates. It is well known that an asymptote of a curve \(\mathscr {C}\) is a line such that the distance between \(\mathscr {C}\) and the line approaches zero as they tend to infinity. However, a curve \(\mathscr {C}\) may have more general curves than lines describing the status of \(\mathscr {C}\) at infinity. These curves are known as g-asymptotes or generalized asymptotes. The pseudocodes of these algorithms are presented, as well as the corresponding implementations. For this purpose, we use the algebra software Maple. A comparative analysis of the algorithms is carried out, based on some properties of the input curves and their results to analyze the efficiency of the algorithms and to establish comparative criteria. The results presented in this paper are a starting point to generalize this study to surfaces or to curves defined by a non-rational parametrization, as well as to improve the efficiency of the algorithms. Additionally, the methods developed can provide a new and different approach in prediction (regression) or classification algorithms in the machine learning field.