arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.11347cs.SCmath.AG
收藏

实代数曲线上连通性查询的算法

Algorithm for connectivity queries on real algebraic curves

Md Nazrul Islam, Adrien Poteaux, Rémi Prébet

AI总结:

本文提出一种在实代数曲线上进行连通性查询的算法,可在对数线性时间内计数连通分量并判定查询点归属,且无需计算完整曲线拓扑。

摘要:

我们考虑在实代数曲线上回答连通性查询的问题。该曲线以代数曲线的实轨迹形式给出,假设处于一般位置,并由某些有理参数化定义。查询点由一个零维参数化给出。我们设计了一种算法,用于计算所研究实曲线的连通分量数量,并判定每个查询点位于哪个连通分量中,其时间复杂度为关于 $N^6$ 的对数线性时间,其中 $N$ 是输入多项式次数和系数位长的最大值。这与当前已知的计算实平面曲线拓扑的最佳界相匹配。该算法的主要新颖之处在于避免了计算曲线的完整拓扑。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑