arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1801.08565cs.CGcs.DMcs.DS
收藏

过山车和毛毛虫

Rollercoasters and Caterpillars

Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey Shallit

摘要:

过山车是一个实数序列,其中每个最大连续子序列,即增加或减少,长度至少为3。通过将该序列转换为平面中的一组点,过山车可以被定义为多边形路径,对于该多边形路径,具有正斜率或负斜率边缘的每个最大子路径至少具有三个点。给定一个不同实数的序列,过山车问题要求一个最大长度的子序列是一个过山车。证明了每个$n$不同实数序列都包含一个长度至少为$n>7$的过山车,而最著名的下限是$Ω(n/\log n)$。本文证明了这一猜想。我们的证明是建设性的,这意味着一个线性时间算法计算过山车的长度。扩展的$O(n\log n)$时间算法计算最长的增加子序列,我们展示了如何计算一个最大长度的过山车在同一时间范围内。$\{1,\dots,n\}$的排列中的最大长度过山车可以在$O(n \log \log n)$时间内计算。寻找过山车的动机是正交点集嵌入的毛毛虫。毛毛虫是一棵树,删除叶子会产生一条路径,称为脊椎。一个俯视的毛毛虫是4度的,这样与每个顶点相邻的两个叶子位于脊椎的相对两侧。作为我们的结果在过山车上的应用,我们能够找到一个平面图的每个$n$节点的顶视图履带上的每一组$\frac{25}{3}n$点在平面上,这样的每个边缘是一个正交的路径与一个弯曲。这改进了所需点数的先前最佳已知上限,即$O(n \log n)$。我们还表明,这样的绘图可以在线性时间内获得,只要点排序顺序。

英文摘要:

A rollercoaster is a sequence of real numbers for which every maximal contiguous subsequence, that is increasing or decreasing, has length at least three. By translating this sequence to a set of points in the plane, a rollercoaster can be defined as a polygonal path for which every maximal sub-path, with positive- or negative-slope edges, has at least three points. Given a sequence of distinct real numbers, the rollercoaster problem asks for a maximum-length subsequence that is a rollercoaster. It was conjectured that every sequence of $n$ distinct real numbers contains a rollercoaster of length at least $\lceil n/2\rceil$ for $n>7$, while the best known lower bound is $Ω(n/\log n)$. In this paper we prove this conjecture. Our proof is constructive and implies a linear-time algorithm for computing a rollercoaster of this length. Extending the $O(n\log n)$-time algorithm for computing a longest increasing subsequence, we show how to compute a maximum-length rollercoaster within the same time bound. A maximum-length rollercoaster in a permutation of $\{1,\dots,n\}$ can be computed in $O(n \log \log n)$ time. The search for rollercoasters was motivated by orthogeodesic point-set embedding of caterpillars. A caterpillar is a tree such that deleting the leaves gives a path, called the spine. A top-view caterpillar is one of degree 4 such that the two leaves adjacent to each vertex lie on opposite sides of the spine. As an application of our result on rollercoasters, we are able to find a planar drawing of every $n$-node top-view caterpillar on every set of $\frac{25}{3}n$ points in the plane, such that each edge is an orthogonal path with one bend. This improves the previous best known upper bound on the number of required points, which is $O(n \log n)$. We also show that such a drawing can be obtained in linear time, provided that the points are given in sorted order.

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

↑