Raimund Seidel
ABSTRACT
We consider the problem of computing a representation of the plane graph induced by one (or more) algebraic curves in the real plane. We make no assumptions about the curves, in particular we allow arbitrary singularities and arbitrary intersection. This problem has been well studied for the case of a single curve. All proposed approaches to this problem so far require finding and counting real roots of polynomials over an algebraic extension of Q, i.e. the coefficients of those polynomials are algebraic numbers. Various algebraic approaches for this real root finding and counting problem have been developed, but they tend to be costly unless speedups via floating point approximations are introduced, which without additional checks in some cases can render the approach incorrect for some inputs.We propose a method that is always correct and that avoids finding and counting real roots of polynomials with non-rational coefficients. We achieve this using two simple geometric approaches: a triple projections method and a curve avoidance method. We have implemented our approach for the case of computing the topology of a single real algebraic curve. Even this prototypical implementation without optimizations appears to be competitive with other implementations.
- D. S. Arnon and S. McCallum. A polynomial time algorithm for the topological type of a real algebraic curve. Journal of Symbolic Computation, 5:213--236, 1988. Google Scholar
Digital Library
- G. E. Collins and R. Loos. Real zeros of polynomials. In B. Buchberger, G. E. Collins, and R. Loos, editors, Computer Algebra: Symbolic and Algebraic Computation, pages 83--94. Springer-Verlag, New York, NY, 1982. Google ScholarDigital Library
- M. Coste and M.-F. Roy. Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets. Journal of Symbolic Computation, 5:121--129, 1988. Google ScholarDigital Library
- D. Cox, J. Little, and D. O'Shea. Ideals, Varieties, and Algorithms. Springer, New York, 1997.Google Scholar
- M. El Kahoui. Computing with real algebraic curves in generic position. in preparation, 2004.Google Scholar
- H. Feng. Decomopsition and Computation of the Topology of Plane Real Algebraic Curves. The Raoyal Institute of Technology, Stockholm, 1992. PhD Thesis.Google Scholar
- L. González-Vega and M. El Kahoui. An improved upper complexity bound for the topology computation of a real algebraic plane curve. Journal of Complexity, 12:527--544, 1996. Google ScholarDigital Library
- L. González-Vega and I. Necula. Efficient topology determination of implicitly defined algebraic plane curves. Computer Aided Geometric Design, 19:719--743, 2002. Google ScholarDigital Library
- H. Hong. An efficient method for analyzing the topology of plane real algebraic curves. Mathematics and Computers in Simulation, 42:571--582, 1996. Google ScholarDigital Library
- T. Sakkalis. The topological configuration of a real algebraic curve. Bulletin of the Australian Mathematical Society, 43:37--50, 1991.Google ScholarCross Ref
- J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, 1999. Google ScholarDigital Library
- C. K. Yap. Fundamental Problems of Algorithmic Algebra. Oxford University Press, New York, Oxford, 2000. Google ScholarDigital Library
Index Terms
- On the exact computation of the topology of real algebraic curves
Recommendations
On the computation of the topology of a non-reduced implicit space curve
ISSAC '08: Proceedings of the twenty-first international symposium on Symbolic and algebraic computationAn algorithm is presented for the computation of the topology of a non-reduced space curve defined as the intersection of two implicit algebraic surfaces.
It computes a Piecewise Linear Structure (PLS) isotopic to the original space curve.
The algorithm ...
Fast and exact geometric analysis of real algebraic plane curves
ISSAC '07: Proceedings of the 2007 international symposium on Symbolic and algebraic computationAn 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 ...
Exact, efficient, and complete arrangement computation for cubic curves
The Bentley-Ottmann sweep-line method can compute the arrangement of planar curves, provided a number of geometric primitives operating on the curves are available. We discuss the reduction of the primitives to the analysis of curves and curve pairs, ...
Comments