Isotopic Meshing of a Real Algebraic Space Curve

This paper presents a new algorithm for computing the topology of an algebraic space curve. Based on an efficient weak generic position-checking method and a method for solving bivariate polynomial systems, the authors give a first deterministic and efficient algorithm to compute the topology of an algebraic space curve. Compared to extant methods, the new algorithm is efficient for two reasons. The bit size of the coefficients appearing in the sheared polynomials are greatly improved. The other is that one projection is enough for most general cases in the new algorithm. After the topology of an algebraic space curve is given, the authors also provide an isotopic-meshing (approximation) of the space curve. Moreover, an approximation of the algebraic space curve can be generated automatically if the approximations of two projected plane curves are first computed. This is also an advantage of our method. Many non-trivial experiments show the efficiency of the algorithm.