Abstract
During the last years several researchers have considered the problem of finding polynomial-time sequential algorithms for the computation of the topology of a real algebraic plane curve. Up till now, we can divide these algorithms into two main groups: those coding real algebraic numbers by means of isolating intervals (see for instance [3] and [7]) and those coding them à la Thom (see [9]). The aim of this note is to survey the state of the art as far as the second group is concerned. In particular we introduce two new such algorithms, one of which is, to our knowledge, the algorithm computing the topology of a real algebraic plane curve with the lowest running time, while the other one has been successfully implemented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Arnon, G. Collins and S. MacCallum, Cylindrical algebraic decomposition I and II, SIAM J. of Computing 13 (1984).
S. Arnborg and H. Fen, Algebraic decomposition of regular curves, J. of Symb. Comp. 5 (1988).
D. Arnon and S. MacCallum, A polynomial-time algorithm for the topological type of a real algebraic curve, J. of Symb. Comp. 5 (1988).
J. Bochnak, M. Coste and M. F. Roy, “Géométrie Algébrique Réelle,” Ergebnisse, Springer-Verlag, 1987.
M. Coste and M.-F. Roy, Thorn’s lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets, J. of Symb. Comp. 5 (1988).
F. Cucker and M.-F. Roy, A theorem on random polynomials and some consequences in average complexity, J. of Symb. Comp. (to appear).
P. Gianni and C. Traverso, Shape determination of real curves and surfaces, Ann. Univ. Ferrara, Sez. VII, Sec. Math. XXIX (1983).
L. González, H. Lombardi, T. Recio and M.-F. Roy, Spécialisation de la suite de Sturm et sous-résultants, RAIRO Inf. Théor. et Appl. (to appear).
M.-F. Roy, Computation of the topology of a real algebraic curve, in “Proceedings of the Conference on Computational geometry and topology,” Sevilla 1987 (to appear).
M.-F. Roy and A. Szpirglas, Complexity of computations on real algebraic numbers, J. of Symb. Comp. (to appear).
M.-F. Roy and A. Szpirglas, Complexity of computations of cylindrical decomposition and topology of real algebraic curves using Thorn’s lemma, in “Proceedings of the Conference on Real Algebraic Geometry,” Trento 1988 (to appear).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media New York
About this chapter
Cite this chapter
Cucker, F., Vega, L.G., Rossello, F. (1991). On algorithms for real algebraic plane curves. In: Mora, T., Traverso, C. (eds) Effective Methods in Algebraic Geometry. Progress in Mathematics, vol 94. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0441-1_5
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0441-1_5
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6761-4
Online ISBN: 978-1-4612-0441-1
eBook Packages: Springer Book Archive