Skip to main content
Log in

Finding the topology of implicitly defined two algebraic plane curves

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

An algorithm is given for computing in a very efficient way the topology of two real algebraic plane curves defined implicitly. The authors preform a symbolic pre-processing that allows us later to execute all numerical computations in an accurate way.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. C. Bajaj and C. M. Hoffmann, Tracing surfaces intersection. Comput. Aided. Geom. Design, 1988, 5: 285–307.

    Article  MathSciNet  MATH  Google Scholar 

  2. J. Keyser, T. Culver, D. Manocha, and S. Krishnan, Efficient and Exact Manipulation of Algebraic Points and Curves, Comput. Aided. Geom. Design, 2000, 32(11): 649–662.

    Article  MATH  Google Scholar 

  3. J. Keyser, T. Culver, D. Manocha, and S. Krishnan, MAPC: A library for efficient and exact manipulation of algebraic points and curves, Proc. 15th Annu. ACM Sympos. Comput. Geom., 1999.

  4. D. Halperin and M. Sharir, Arrangements and their applications in robotics: recent developments. WAFR: Proceedings of the workshop on Algorithmic foundations of robotics, Natick, MA, USA, A. K. Peters, Ltd, 1995.

    Google Scholar 

  5. M. Sharir, Arrangements and their applications, Handbook of Computational Geometry, J. Sack ed., 2000.

  6. X. S. Gao and M. Li, Rational quadratic approximation to real algebraic curves, Comput. Aided Geom. Design, 2004, 21(8): 805–828.

    Article  MathSciNet  MATH  Google Scholar 

  7. S. Basu, R. Pollack, and M. F. Roy. Algorithms in Real Algebraic Geometry, volume 10 of Algorithms and Computation in Mathematics, Springer-Verlag, Berlin, 2003.

    Google Scholar 

  8. G. E. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition, Automata Theory and Formal Languages (Second GI Conf., Kaiser-slautern, 1975), Lecture Notes in Comput. Sci., Vol. 33. Springer, Berlin, 1975.

    Google Scholar 

  9. L. Gonzalez-Vega and I. Necula, Efficient topology determination of implicitly defined algebraic plane curves, Comput. Aided Geom. Design, 2002, 19(9): 719–743.

    Article  MathSciNet  MATH  Google Scholar 

  10. Y. F. Chen, Lectures on Computer Algebra, Higher Education Press, 2009.

  11. E. Schömer and N. Wolpert, An exact and efficient approach for computing a cell in an arrangement of quadrics, Computational Geometry: Theory and Applications, 2006, 33(1–2): 65–97.

    Article  MathSciNet  MATH  Google Scholar 

  12. N. Wolpert, An exact and efficient approach for computing a cell in an arrangement of quadrics. PhD thesis, Universität des Saarlandes zu Saarbrücken, 2002.

  13. J. S. Cheng, X. S. Gao, and J. Li, Root isolation for bivariate polynomial systems with local generic position method, ISSAC, 2009: 103–110.

  14. D. S. Arnon, G. E. Collins, and S. McCallum, Cylindrical algebraic decomposition I: The basic algorithm, SIAM J. Comput., 1984, 13(4): 865–877.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ben Gao.

Additional information

This paper was recommended for publication by Editor Xiao-Shan GAO.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gao, B., Chen, Y. Finding the topology of implicitly defined two algebraic plane curves. J Syst Sci Complex 25, 362–374 (2012). https://doi.org/10.1007/s11424-012-1145-7

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-012-1145-7

Key words

Navigation