A Continuation Method for Visualizing Planar Real Algebraic Curves with Singularities
We present a new method for visualizing planar real algebraic curves inside a bounding box based on numerical continuation and critical point methods. Since the topology of the curve near a singular point is not numerically stable, we trace the curve only outside neighborhoods of singular points and replace each neighborhood simply by a point, which produces a polygonal approximation that is \(\epsilon \)-close to the curve. Such an approximation is more stable for defining the numerical connectedness of the complement of the curve, which is important for applications such as solving bi-parametric polynomial systems.
The algorithm starts by computing three types of key points of the curve, namely the intersection of the curve with small circles centered at singular points, regular critical points of every connected component of the curve, as well as intersection points of the curve with the given bounding box. It then traces the curve starting with and in the order of the above three types of points. This basic scheme is further enhanced by several optimizations, such as grouping singular points in natural clusters and tracing the curve by a try-and-resume strategy. The effectiveness of the algorithm is illustrated by numerous examples.
The authors would like to thank Chee K. Yap and the reviewers, in particular Reviewer 3, for valuable suggestions. This work is partially supported by the projects NSFC (11471307, 11671377, 61572024), and the Key Research Program of Frontier Sciences of CAS (QYZDB-SSW-SYS026).
- 3.Bennett, H., Papadopoulou, E., Yap, C.: Planar minimization diagrams via subdivision with applications to anisotropic Voronoi diagrams. Comput. Graph. Forum 35 (2016)Google Scholar
- 9.Chen, C., Wu, W.: A numerical method for analyzing the stability of bi-parametric biological systems. In: SYNASC 2016, pp. 91–98 (2016)Google Scholar
- 10.Chen, C., Wu, W.: A numerical method for computing border curves of bi-parametric real polynomial systems and applications. In: Gerdt, V.P., Koepf, W., Seiler, W.M., Vorozhtsov, E.V. (eds.) CASC 2016. LNCS, vol. 9890, pp. 156–171. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-45641-6_11CrossRefGoogle Scholar
- 14.Daouda, D., Mourrain, B., Ruatta, O.: On the computation of the topology of a non-reduced implicit space curve. In: ISSAC 2008, pp. 47–54 (2008)Google Scholar
- 21.Labs, O.: A list of challenges for real algebraic plane curve visualization software. In: Emiris, I., Sottile, F., Theobald, T. (eds.) Nonlinear Computational Geometry. The IMA Volumes in Mathematics and Its Applications, vol. 151, pp. 137–164. Springer, New York (2010). https://doi.org/10.1007/978-1-4419-0999-2_6CrossRefGoogle Scholar
- 27.Seidel, R., Wolpert, N.: On the exact computation of the topology of real algebraic curves. In: Proceedings of the Twenty-First Annual Symposium on Computational Geometry, SCG 2005, pp. 107–115. ACM, New York (2005)Google Scholar
- 28.Shen, F., Wu, W., Xia, B.: Real root isolation of polynomial equations based on hybrid computation. In: ASCM 2012, pp. 375–396 (2012)Google Scholar
- 29.Wu, W., Chen, C., Reid, G.: Penalty function based critical point approach to compute real witness solution points of polynomial systems. In: Gerdt, V.P., Koepf, W., Seiler, W.M., Vorozhtsov, E.V. (eds.) CASC 2017. LNCS, vol. 10490, pp. 377–391. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-66320-3_27CrossRefGoogle Scholar
- 31.Yang, L., Xia, B.: Real solution classifications of a class of parametric semi-algebraic systems. In: A3L 2005, pp. 281–289 (2005)Google Scholar