Design and implementation of symbolic algorithms for the computation of generalized asymptotes (Q6133709)

In the paper under review, the authors present algorithms to compute efficiently generalized asymptotes to algebraic plane curves defined either implicitly or in a parametric way. The definition provided of generalized asymptote is inerently related to the notion of euclidean distance; informally a generalized asymptote \(G\) of a curve \(C\) is defined as a curve of minimum degree \(d\) approaching at an infinity branch \(B\) the curve \(C\). A detailed analysis of the proposed algorithms (as well as pseudocode) is presented, as well as proposed generalizations.