|
ABSTRACT
An algorithm is presented for the geometric analysis of an algebraic curve f(x, y) = 0 in the real affine plane. It computes a cylindrical algebraic decomposition (CAD) of the plane, augmented with adjacency information. The adjacency information describes the curve's topology by a topologically equivalent planar graph. The numerical data in the CAD gives an embedding of the graph. The algorithm is designed to provide the exact result for all inputs but to perform only few symbolic operations for the sake of efficiency. In particular, the roots of f(∝, y) at a critical x-coordinate . The algorithm is implemented as C++ library AlciX in the EXACUS project. Running time comparisons with top by Gonzalez-Vega and Necula (2002), and with cad2d by Brown demonstrate its efficiency.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
J. Abbott: "Quadratic Interval Refinement for Real Roots". URL http://www.dima.unige.it/~abbott/. Poster presented at the 2006 Int. Symp. on Symb. and Alg. Comp. (ISSAC 2006).
|
| |
2
|
|
| |
3
|
|
| |
4
|
|
| |
5
|
E. Berberich, A. Eigenwillig, M. Hemmer, S. Hert, L. Kettner, K. Mehlhorn, J. Reichel, S. Schmitt, E. Schömer, N. Wolpert: "EXACUS: Efficient and exact algorithms for curves and surfaces". In: Proc. of the 13th Ann. European Symp. on Alg. (ESA 2005), LNCS, vol. 3669. Springer, 2005 155--166.
|
| |
6
|
C. W. Brown: "Constructing Cylindrical Algebraic Decompositions of the Plane Quickly", 2002. URL http://www.cs.usna.edu/~wcbrown/. Unpublished.
|
| |
7
|
|
 |
8
|
|
| |
9
|
|
| |
10
|
L. Ducos: "Optimizations of the Subresultant Algorithm". J. Pure Appl. Alg. 145 (2000) 149--163.
|
| |
11
|
|
| |
12
|
A. Eigenwillig, L. Kettner, W. Krandick, K. Mehlhorn, S. Schmitt, N. Wolpert: "A Descartes Algorithm for Polynomials with Bit-Stream Coefficients". In: 8th Int. Workshop on Comp. Alg. in Scient. Comp. (CASC 2005), LNCS, vol. 3718, 2005 138--149.
|
 |
13
|
|
| |
14
|
|
| |
15
|
|
| |
16
|
L. Gonzalez-Vega, T. Recio, H. Lombardi, M. -F. Roy: "Sturm-Habicht Sequences, Determinants and Real Roots of Univariate Polynomials". In: B. Caviness, J. Johnson (eds.) Quantifier Elimination and Cylindrical Algebraic Decomposition, 300--316. Springer, 1998.
|
| |
17
|
|
| |
18
|
J. R. Johnson: "Algorithms for polynomial real root isolation". In: B. F. Caviness, J. R. Johnson (eds.) Quantifier Elimination and Cylindrical Algebraic Decomposition, 269--299. Springer, 1998.
|
 |
19
|
Jeremy R. Johnson , Werner Krandick , Kevin Lynch , David G. Richardson , Anatole D. Ruslanov, High-performance implementations of the Descartes method, Proceedings of the 2006 international symposium on Symbolic and algebraic computation, July 09-12, 2006, Genoa, Italy
[doi> 10.1145/1145768.1145797]
|
| |
20
|
M. Kerber: Analysis of Real Algebraic Plane Curves. Master's thesis, Universität des Saarlandes, Saarbrücken, Germany, 2006.
|
| |
21
|
W. Krandick, K. Mehlhorn: "New Bounds for the Descartes Method". J. Symb. Comp. 41 (2006) 49--66.
|
| |
22
|
|
| |
23
|
|
 |
24
|
|
| |
25
|
A. Strzebonski: "Cylindrical Algebraic Decomposition using validated numerics". J. Symb. Comp. 41 (2006) 1021--1038.
|
CITED BY 15
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
D. A. Aruliah , Robert M. Corless , Azar Shakoori , Laureano Gonzalez-Vega , Ignacio F. Rua, Computing the topology of a real algebraic plane curve whose equation is not directly available, Proceedings of the 2007 international workshop on Symbolic-numeric computation, July 25-27, 2007, London, Ontario, Canada
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Jinsan Cheng , Sylvain Lazard , Luis Peñaranda , Marc Pouget , Fabrice Rouillier , Elias Tsigaridas, On the topology of planar algebraic curves, Proceedings of the 25th annual symposium on Computational geometry, June 08-10, 2009, Aarhus, Denmark
|
|