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

多边形环境中双色点集的三角分离

On Triangluar Separation of Bichromatic Point Sets in Polygonal Environment

Farnaz Sheikhi, Sharareh Alipour

摘要:

设$\mathcal P$是一个简单的多边形环境,其中$k$顶点位于平面中。假设$b$蓝色点的集合$B$和$r$红色点的集合$R$分布在$\mathcal P$中。我们研究的问题,计算三角形,分离集$B$和$R$,并落在$\mathcal P$。我们称这些三角形为\emph{inscribed triangular separators}。我们提出了一个输出敏感的算法来解决这个问题在$O(r \cdot (r+c_B+k)+h_\triangle)$时间,其中$c_B$是凸壳的$B$的大小,和$h_\triangle$是内接三角形分隔符的数量。我们还研究了不存在任何内接三角形分隔符的情况。这可能是由于红点在$B$的凸包周围紧密分布而在该凸包内没有红点。在这种情况下,我们专注于计算一个三角形,将大部分蓝色点与红色点分开。我们将这些三角形称为\emph{maximum triangular separators}。假设$n=r+b$,我们设计了一个常数因子近似算法来计算这样的分离器在$O(n^{4/3} \log^3 n)$时间。“有资格获得最佳学生论文”

英文摘要:

Let $\mathcal P$ be a simple polygonal environment with $k$ vertices in the plane. Assume that a set $B$ of $b$ blue points and a set $R$ of $r$ red points are distributed in $\mathcal P$. We study the problem of computing triangles that separate the sets $B$ and $R$, and fall in $\mathcal P$. We call these triangles \emph{inscribed triangular separators}. We propose an output-sensitive algorithm to solve this problem in $O(r \cdot (r+c_B+k)+h_\triangle)$ time, where $c_B$ is the size of convex hull of $B$, and $h_\triangle$ is the number of inscribed triangular separators. We also study the case where there does not exist any inscribed triangular separators. This may happen due to the tight distribution of red points around convex hull of $B$ while no red points are inside this hull. In this case we focus to compute a triangle that separates most of the blue points from the red points. We refer to these triangles as \emph{maximum triangular separators}. Assuming $n=r+b$, we design a constant-factor approximation algorithm to compute such a separator in $O(n^{4/3} \log^3 n)$ time. "Eligible for best student paper"

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

↑