最大生成树边缘诱导的刺穿直径盘
Piercing Diametral Disks Induced by Edges of Maximum Spanning Tree
摘要:
令$P$是平面中的点的集合,并且令$T$是$P$的最大权重生成树。对于边缘$(p,q)$,令$D_{pq}$为由$(p,q)$引起的直径盘,即,所述盘具有段$\overline{pq}$作为其直径。设$\cal{D_T}$是由$T$的边诱导的直径圆盘的集合。本文证明了一个点足以穿透$\cal{D_T}$中的所有圆盘,因此集合$\cal{D_T}$是Helly.实际上,我们证明了$P$的最小封闭圆的中心包含在$\cal{D_T}$的所有圆盘中,因此可以在线性时间内计算刺穿点。
英文摘要:
Let $P$ be a set of points in the plane and let $T$ be a maximum-weight spanning tree of $P$. For an edge $(p,q)$, let $D_{pq}$ be the diametral disk induced by $(p,q)$, i.e., the disk having the segment $\overline{pq}$ as its diameter. Let $\cal{D_T}$ be the set of the diametral disks induced by the edges of $T$. In this paper, we show that one point is sufficient to pierce all the disks in $\cal{D_T}$, thus, the set $\cal{D_T}$ is Helly. Actually, we show that the center of the smallest enclosing circle of $P$ is contained in all the disks of $\cal{D_T}$, and thus the piercing point can be computed in linear time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。