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

在最小网格上绘制几乎凸集

Drawing the Almost Convex Set in an Integer Grid of Minimum Size

Frank Duque, Ruy Fabila-Monroy, Carlos Hidalgo-Toscano, Pablo Pérez-Lantero

摘要:

在2001年,Károlyi,Pach和Tóth引入了一个点集族来解决一个Erdens-Szekeres型问题;它已经被用来解决其他几个Eddens-Szekeres型问题。在本文中,我们把这些集合称为套几乎凸集。几乎凸集$\mathcal{X}$具有如下性质:由$\mathcal{X}$的同一凸层中的三个点所确定的每个三角形的内部恰好包含$\mathcal{X}$的一个点。本文给出了套几乎凸集的一个刻画。我们的刻画意味着最多存在一个(直到阶型)$n$点的几乎凸集套。我们使用我们的特征,以获得一个线性时间算法来构造嵌套几乎凸集的$n$点,与整数坐标的绝对值最多$O(n^{\log_2 5})$。最后,我们使用我们的特征,以获得一个$O(n\log n)$时间算法,以确定一组点是否是一个嵌套的几乎凸集。

英文摘要:

In 2001, Károlyi, Pach and Tóth introduced a family of point sets to solve an Erdős-Szekeres type problem; which have been used to solve several other Edős-Szekeres type problems. In this paper we refer to these sets as nested almost convex sets. A nested almost convex set $\mathcal{X}$ has the property that the interior of every triangle determined by three points in the same convex layer of $\mathcal{X}$, contains exactly one point of $\mathcal{X}$. In this paper, we introduce a characterization of nested almost convex sets. Our characterization implies that there exists at most one (up to order type) nested almost convex set of $n$ points. We use our characterization to obtain a linear time algorithm to construct nested almost convex sets of $n$ points, with integer coordinates of absolute values at most $O(n^{\log_2 5})$. Finally, we use our characterization to obtain an $O(n\log n)$-time algorithm to determine whether a set of points is a nested almost convex set.

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

↑