arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0902.1612cs.SC
收藏

计算光滑紧致实超曲面中路线图的小步/大步Monte Carlo算法

A baby steps/giant steps Monte Carlo algorithm for computing roadmaps in smooth compact real hypersurfaces

Mohab Safey El Din, Éric Schost

摘要:

我们考虑的问题,真正的代数集的道路图的建设。这个问题是由Canny提出来回答连接问题和解决运动规划问题的。给定具有有理系数的$s$多项式方程,在$n$变量中具有次数$D$,Canny算法在$\mathbb{Q}$中具有$s^n\log(s) D^{O(n^2)}$操作的Monte Carlo成本;确定性版本在时间上运行$s^n \log(s) D^{O(n^4)}$。下一个改进是由于巴苏,波拉克和罗伊,与算法的确定性成本$s^{d+1} D^{O(n^2)}$更一般的问题计算路线图的半代数集($d \le n$是一个相关的对象的尺寸)。我们给出了一个Monte Carlo算法的复杂性$(nD)^{O(n^{1.5})}$的计算路线图的一个紧凑的超曲面$V$度$D$在$n$变量的问题,我们还必须假设$V$有一个有限数量的奇点。即使在这些额外的假设下,以前的算法也没有比$D^{O(n^2)}$更好的成本。

英文摘要:

We consider the problem of constructing roadmaps of real algebraic sets. The problem was introduced by Canny to answer connectivity questions and solve motion planning problems. Given $s$ polynomial equations with rational coefficients, of degree $D$ in $n$ variables, Canny's algorithm has a Monte Carlo cost of $s^n\log(s) D^{O(n^2)}$ operations in $\mathbb{Q}$; a deterministic version runs in time $s^n \log(s) D^{O(n^4)}$. The next improvement was due to Basu, Pollack and Roy, with an algorithm of deterministic cost $s^{d+1} D^{O(n^2)}$ for the more general problem of computing roadmaps of semi-algebraic sets ($d \le n$ is the dimension of an associated object). We give a Monte Carlo algorithm of complexity $(nD)^{O(n^{1.5})}$ for the problem of computing a roadmap of a compact hypersurface $V$ of degree $D$ in $n$ variables; we also have to assume that $V$ has a finite number of singular points. Even under these extra assumptions, no previous algorithm featured a cost better than $D^{O(n^2)}$.

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

↑