Braid monodromy computation of real singular curves (Q2010779)

The authors generalize the algorithm of \textit{B. Moishezon} and \textit{M. Teicher} [Lect. Notes Math. 1479, 131--180 (1991; Zbl 0764.14014)] used for the computation of the braid monodromy of an almost real curve. The new algorithm suits a larger family of curves, it can be applied to the computation of braid monodromy of general algebraic (not only cuspidal) curves, with some non simple singularities. It works also when in the fiber the curve admits any number of imaginary points. The authors provide two examples of how to use the generalized algorithm.