Asymptotic Behavior of an Implicit Algebraic Plane Curve
classification
🧮 math.AG
keywords
algebraicbehaviorcurvesplaneasymptoticinfinityalgorithmallow
read the original abstract
In this paper, we introduce the notion of infinity branches as well as approaching curves. We present some properties which allow us to obtain an algorithm that compares the behavior of two implicitly defined algebraic plane curves at the infinity. As an important result, we prove that if two plane algebraic curves have the same asymptotic behavior, the Hausdorff distance between them is finite.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.