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

平行线段集之间Hausdorff距离的计算

Computation of the Hausdorff distance between sets of line segments in parallel

Freie Universität Berlin(柏林自由大学)

Helmut Alt, Ludmila Scharf

摘要:

我们表明,Hausdorff距离的两组不相交的线段可以并行计算$O(\log^2 n)$时间使用O(n)的处理器在CREW-PRAM计算模型。我们讨论如何使用先前已知的并行算法并行执行顺序算法的某些部分;并确定并行计算问题的迄今未解决的部分,如下所示:给定两组$x$ -单调曲线段,红色和蓝色,对于每个红色段,找到其与蓝色组的极值交点,即具有最小和最大$x$坐标的点。假设每个线段集都是无交集的。对于这个交叉问题,我们描述了一个并行算法,完成Hausdorff距离计算在规定的时间和处理器的界限。

英文摘要:

We show that the Hausdorff distance for two sets of non-intersecting line segments can be computed in parallel in $O(\log^2 n)$ time using O(n) processors in a CREW-PRAM computation model. We discuss how some parts of the sequential algorithm can be performed in parallel using previously known parallel algorithms; and identify the so-far unsolved part of the problem for the parallel computation, which is the following: Given two sets of $x$-monotone curve segments, red and blue, for each red segment find its extremal intersection points with the blue set, i.e. points with the minimal and maximal $x$-coordinate. Each segment set is assumed to be intersection free. For this intersection problem we describe a parallel algorithm which completes the Hausdorff distance computation within the stated time and processor bounds.

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

↑