Minimum spanning blob-trees
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.
Authors
- Josef Tkadlec (ORCID: https://orcid.org/0000-0003-0148-7722)
- Daniel Perz (ORCID: https://orcid.org/0000-0002-6557-2355)
- Marc van Kreveld (ORCID: https://orcid.org/0000-0001-8208-3468)
- Katharina Klost (ORCID: https://orcid.org/0000-0002-9884-3297)
- Günter Rote (ORCID: https://orcid.org/0000-0002-0351-5945)
Publication Details
- Journal
- ArXiv.org
- Published
- 2025-03-04
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00