Minimum spanning blob-trees
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913717927542784 |
|---|---|
| author | Klost, Katharina van Kreveld, Marc Perz, Daniel Rote, Günter Tkadlec, Josef |
| author_facet | Klost, Katharina van Kreveld, Marc Perz, Daniel Rote, Günter Tkadlec, Josef |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_02439 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Minimum spanning blob-trees Klost, Katharina van Kreveld, Marc Perz, Daniel Rote, Günter Tkadlec, Josef Computational Geometry 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. |
| title | Minimum spanning blob-trees |
| topic | Computational Geometry |
| url | https://arxiv.org/abs/2503.02439 |