We investigate blob-trees, a new way of connecting a set of points, by a mixture of enclosing them by cycles (as in the convex hull) and connecting them by edges (as in a spanning tree). We show that a minimum-cost blob-tree for $n$ points can be computed in $O(n^3)$ time.

翻译：本文研究团树——一种连接点集的新方法，它通过循环包围（如凸包）与边连接（如生成树）相结合的方式实现。我们证明，对于 $n$ 个点，最小代价团树可在 $O(n^3)$ 时间内计算得到。