Minimum spanning blob-trees
Computational Geometry
2025-03-05 v1
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 points can be computed in time.
Keywords
Cite
@article{arxiv.2503.02439,
title = {Minimum spanning blob-trees},
author = {Katharina Klost and Marc van Kreveld and Daniel Perz and Günter Rote and Josef Tkadlec},
journal= {arXiv preprint arXiv:2503.02439},
year = {2025}
}
Comments
20 pages, 14 figures. Full version of a paper to be presented at the 41st European Workshop on Computational Geometry, Liblice, Czech republic, April 9-11, 2025. (EuroCG'25)