定向 Θ_6 图的覆盖比为 5
The Spanning Ratio of the Directed $Θ_6$-Graph is 5
AI总结:
本文证明了定向 Θ_6 图的覆盖比为 5,填补了该图覆盖比的理论空白。
摘要:
给定一个有限点集 P ⊂ ℝ²,定向 Θ_6 图(记为 \vecΘ_6(P))是由于其与 Delaunay 三角剖分的密切关系而被广泛研究的几何图。定义如下:平面中每个点 u ∈ P 的周围被划分为 6 个等角扇区,以 u 为顶点。在每个扇区中,u 与该扇区的角平分线投影最近的点相连。等价地,\vecΘ_6(P) 图中存在从 u 到 v 的边,当且仅当 v 的内部 ∇_u^v 与 P 无交集,其中 ∇_u^v 是唯一的等边三角形,u 位于一个角,v 位于对边,且其边与扇区边界平行。之前已证明 \vecΘ_6(P) 图的覆盖比在最坏情况下介于 4 到 7 之间(Akitaya, Biniaz, and Bose, Comput. Geom., 105-106:101881, 2022)。我们通过证明覆盖比为 5 的精确值来缩小这个差距。这是任何 \vecΘ_k(P) 图覆盖比的首个精确界限。我们的下界通过将长路径映射为收敛级数来建模。上界证明使用了该领域特有的技术。我们利用线性规划证明在多个候选路径中,存在一个路径满足我们的界限。
英文摘要:
Given a finite set $P\subset\mathbb{R}^2$, the directed Theta-6 graph, denoted $\vecΘ_6(P)$, is a well-studied geometric graph due to its close relationship with the Delaunay triangulation. The $\vecΘ_6(P)$-graph is defined as follows: the plane around each point $u\in P$ is partitioned into $6$ equiangular cones with apex $u$, and in each cone, $u$ is joined to the point whose projection on the bisector of the cone is closest. Equivalently, the $\vecΘ_6(P)$-graph contains an edge from $u$ to $v$ exactly when the interior of $\nabla_u^v$ is disjoint from $P$, where $\nabla_u^v$ is the unique equilateral triangle containing $u$ on a corner, $v$ on the opposite side, and whose sides are parallel to the cone boundaries. It was previously shown that the spanning ratio of the $\vecΘ_6(P)$-graph is between $4$ and $7$ in the worst case (Akitaya, Biniaz, and Bose \emph{Comput. Geom.}, 105-106:101881, 2022). We close this gap by showing a tight spanning ratio of 5. This is the first tight bound proven for the spanning ratio of any $\vecΘ_k(P)$-graph. Our lower bound models a long path by mapping it to a converging series. Our upper bound proof uses techniques novel to the area of spanners. We use linear programming to prove that among several candidate paths, there exists a path satisfying our bound.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。