Year: 2025
Type: preprint
Abstract: 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.
Source: arXiv (Cornell University)
Language: English
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4415334987
Cites:
Cited by:
Related to: