平面生成树的点集包装
Packing Plane Spanning Trees into a Point Set
摘要:
设$P$是平面中一般位置的一组$n$点。我们证明了在$P$上至少有$\lfloor n/3\rfloor$平面生成树可以被包装成完全几何图.这改进了以前最好的已知下限$Ω\left(\sqrt{n}\right)$。对我们的证明这个下限,我们表明,中心的一组点,在$d$维空间中的一般位置,是尺寸$0$或$d$。
英文摘要:
Let $P$ be a set of $n$ points in the plane in general position. We show that at least $\lfloor n/3\rfloor$ plane spanning trees can be packed into the complete geometric graph on $P$. This improves the previous best known lower bound $Ω\left(\sqrt{n}\right)$. Towards our proof of this lower bound we show that the center of a set of points, in the $d$-dimensional space in general position, is of dimension either $0$ or $d$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。