轴对齐包围盒内的通用无交叉覆盖路径
General uncrossing covering paths inside the axis-aligned bounding box
AI总结:
本研究提出M$\Lambda$I算法,可在k维点集的最小轴对齐包围盒内生成无交叉覆盖路径,其链节长度小于点集基数;还针对k>2时的$G_{3,3,\ldots,3}$构造了满足特定包围盒约束的无交叉覆盖路径。
摘要:
给定满足$n_k \geq \cdots \geq n_2 \geq n_1 \in \mathbb{Z}^+$的有限点集$G_{n_1,n_2,\ldots,n_k} \subset \mathbb{R}^k$(大小为$n_1 \cdot n_2 \cdot \ldots \cdot n_k$),我们提出一种名为M$\Lambda$I的新算法,它能在最小轴对齐包围盒$[0,n_1-1] \times [0,n_2-1] \times \cdots \times [0,n_k-1]$内返回一条无交叉覆盖路径,该路径由$3 \cdot \prod_{i=1}^{k-1} n_i-2$条长度为$n_k-1$单位的链节组成。因此,对于任意$n_k \geq 3$,我们的M$\Lambda$I算法给出的覆盖路径的链节长度小于点集$G_{n_1,n_2,\ldots,n_k}$的基数。此外,在$k>2$的假设下,我们给出了$G_{3,3,\ldots,3}$的一条无交叉覆盖路径,它由$20 \cdot 3^{k-3}-2$条长度均为2单位的直线边构成,且受限于轴对齐包围盒$\left[0,4-\sqrt{3}\right] \times \left[0,4-\sqrt{3}\right] \times [0, 2]^{k-2}$。
英文摘要:
Given the finite set of $n_1 \cdot n_2 \cdot \ldots \cdot n_k$ points $G_{n_1,n_2,\ldots,n_k} \subset \mathbb{R}^k$ such that $n_k \geq \cdots \geq n_2 \geq n_1 \in \mathbb{Z}^+$, we introduce a new algorithm, called M$Λ$I, which returns an uncrossing covering path inside the minimum axis-aligned bounding box $[0,n_1-1] \times [0,n_2-1] \times \cdots \times [0,n_k-1]$, consisting of $3 \cdot \prod_{i=1}^{k-1} n_i-2$ links of prescribed length $n_k-1$ units. Thus, for any $n_k \geq 3$, the link length of the covering path provided by our M$Λ$I-algorithm is smaller than the cardinality of the set $G_{n_1,n_2,\ldots,n_k}$. Furthermore, assuming $k>2$, we present an uncrossing covering path for $G_{3,3,\ldots,3}$, consisting of $20 \cdot 3^{k-3}-2$ straight-line edges that are $2$ units long each, which is constrained by the axis-aligned bounding box $\left[0,4-\sqrt{3}\right] \times \left[0,4-\sqrt{3}\right] \times [0, 2]^{k-2}$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。