Cargando…
No-Dimensional Tverberg Theorems and Algorithms
Tverberg’s theorem states that for any [Formula: see text] and any set [Formula: see text] of at least [Formula: see text] points in d dimensions, we can partition P into k subsets whose convex hulls have a non-empty intersection. The associated search problem of finding the partition lies in the co...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2022
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9712399/ https://www.ncbi.nlm.nih.gov/pubmed/36466127 http://dx.doi.org/10.1007/s00454-022-00380-1 |