arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.08900cs.CG
收藏

一种保证欧氏空间中任意点云的快速近似骨架

A fast approximate skeleton with guarantees for any cloud of points in a Euclidean space

Yury Elkin, Di Liu, Vitaliy Kurlin

摘要:

树重建问题是找到一个嵌入的直线树,近似于$\mathbb{R}^m$中给定的无组织点云,直到一定的误差。这一问题的实际解决方案将加速发现具有所需物理性质(如粘度)的新胶体产品。我们定义的近似骨架的任何有限点云$C$在一个欧氏空间的理论保证。近似骨架ASk $(C)$总是属于$C$的给定偏移,即,从$C$到ASk $(C)$的最大距离可以是给定的最大误差。近似骨架中的顶点数接近于最优树中的最小数,其系数为2。任何无组织点云$C$的新近似骨架都是在$C$中的点数的近似线性时间内计算的。最后,近似骨架在重建真实胶束和随机云的大型数据集的大小和准确性方面优于过去的卷积算法。

英文摘要:

The tree reconstruction problem is to find an embedded straight-line tree that approximates a given cloud of unorganized points in $\mathbb{R}^m$ up to a certain error. A practical solution to this problem will accelerate a discovery of new colloidal products with desired physical properties such as viscosity. We define the Approximate Skeleton of any finite point cloud $C$ in a Euclidean space with theoretical guarantees. The Approximate Skeleton ASk$(C)$ always belongs to a given offset of $C$, i.e. the maximum distance from $C$ to ASk$(C)$ can be a given maximum error. The number of vertices in the Approximate Skeleton is close to the minimum number in an optimal tree by factor 2. The new Approximate Skeleton of any unorganized point cloud $C$ is computed in a near linear time in the number of points in $C$. Finally, the Approximate Skeleton outperforms past skeletonization algorithms on the size and accuracy of reconstruction for a large dataset of real micelles and random clouds.

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

↑