Abstract
We describe a computer program for the automatic analysis of a real plane affine algebraic curve. The input to the program is a bivariate integral polynomial F (x, y); the outputs are a report on the real curve defined by F(x, y) = 0, and a picture of the curve. The report contains the following information: whether the curve is irreducible, whether singular, and whether bounded; the number of its connected components and the dimension of each; the number of singular, turning, and level points of the curve. Approximations to these special points can be obtained to any desired precision; the more precision, the more time required. The exact form of the picture is controlled by the user; a topologically correct but "linearized" picture can be produced relatively quickly, while a more accurate drawing can be generated but requires more time. The program makes essential use of the clustering cylindrical algebraic decomposition algorithm [Arnon DS: Algorithms for the geometry of semi-algebraic sets (Dissertation). Technical Report #436, Computer Science Department, University of Wisconsin-Madison, 1981].
- {ARN81} Arnon DS: Algorithms for the geometry of semi-algebraic sets, Ph.D. Dissertation, Technical Report #436, Computer Sciences Department, University of Wisconsin - Madison, 1981. Google ScholarDigital Library
- {COL75} Collins GE: Quantifier elimination for real closed fields by cylindrical algebraic decomposition, in Second GI Conference on Automata Theory and Formal Languages, vol. 33 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1975, pp 134--183. Google ScholarDigital Library
- {COL76} Collins GE: Quantifier elimination for real closed fields by cylindrical algebraic decomposition - a synopsis. SIGSAM Bulletin of the ACM 10, 1 (1976), pp 10--12. Google ScholarDigital Library
Recommendations
Computing real inflection points of cubic algebraic curves
Shape modeling using planar cubic algebraic curves calls for computing the real inflection points of these curves since inflection points represents important shape feature. A real inflection point is also required for transforming projectively a planar ...
Algorithms for Rational Real Algebraic Curves
In this paper, we study fundamental properties of real curves, especially of rational real curves, and we derive several algorithms to decide the reality and rationality of curves in the complex plane. Furthermore, if the curve is real and rational, we ...
Radical parametrizations of algebraic curves by adjoint curves
We present algorithms for parametrizing by radicals an irreducible curve, not necessarily plane, when the genus is less than or equal to 4 and the curve is defined over an algebraically closed field of characteristic zero. In addition, we also present ...
Comments