We consider the problem of answering connectivity queries on a real algebraic curve. The curve is given as the real trace of an algebraic curve, assumed to be in generic position, and being defined by some rational parametrizations. The query points are given by a zero-dimensional parametrization. We design an algorithm which counts the number of connected components of the real curve under study, and decides which query point lie in which connected component, in time log-linear in $N^6$, where $N$ is the maximum of the degrees and coefficient bit-sizes of the polynomials given as input. This matches the currently best-known bound for computing the topology of real plane curves. The main novelty of this algorithm is the avoidance of the computation of the complete topology of the curve.

翻译：我们考虑在实代数曲线上回答连通性查询的问题。该曲线由代数曲线的实迹给出，假定处于一般位置，并由若干有理参数化定义。查询点通过零维参数化给出。我们设计了一种算法，该算法计算所研究实曲线的连通分支数量，并判断每个查询点属于哪个连通分支，其时间复杂度为 $N^6$ 的线性对数阶，其中 $N$ 是输入多项式的最大次数和系数比特长度。这匹配了当前计算实平面曲线拓扑的最佳已知边界。该算法的主要创新在于避免了计算曲线的完整拓扑结构。