Abstract
In this paper, an algorithm that determines a real algebraic curve is outlined. Its basic step is to divide the plane into subdomains that include only simple branches of the algebraic curve without singular points. Each of the branches is then stably and efficiently traced in the particular subdomain. Except for tracing, the algorithm requires only a couple of simple operations on polynomials that can be carried out exactly if the coefficients are rational, and the determination of the real roots of several univariate polynomials.
Similar content being viewed by others
References
Chen F.L., Kozak J., The intersection of a triangular Bézier patch and a plane, Comput. Math., 12(1994) 138-146.
Chen. F-L., Kozak J., On computing zeros of a bivariate Bernstein polynomial, Comput. Math., 14(1996),237-248.
Fu Q. X., The intersection of a bicubic Bézier patch and a plane, Comput. Aided Geom. Design, 7(1990)475-488.
Goldman R. N., Sederberg T. W., Anderson D. C., Vector elimination: A technique for implicitization, inversion, and intersection of planar parametric rational polynomial curves, Comput. Aided Geom. Design, 1 (1984) 327-356.
Hille. E., Analytic Function Theory, Vol. II, Introductions to Higher Mathematics, Ginn and Co., Boston, Mass-New York-Toronto, Ont., 1962, pp. 93–96.
Spencer,M. R., Polynomial real root finding in Bernstein form, PH. D thesis, Brigham Young University, USA.
Author information
Authors and Affiliations
Additional information
Supported by NSF and SF of National Educational Committee of China.
Suppotred in part by ICTP, and in part by NSF and SF of National Educational Committee of China.
Supported by the Ministry of Science and Technology of Slovenia.
Rights and permissions
About this article
Cite this article
Falai, C., Yuyu, F. & Kozak, J. Tracing a planar algebraic curve. Appl. Math. Chin. Univ. 12, 15–24 (1997). https://doi.org/10.1007/s11766-997-0002-2
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s11766-997-0002-2