Algorithms for Tolerated Tverberg Partitions

DOI10.1007/978-3-642-45030-3_28zbMath1406.68122arXiv1306.3452OpenAlexW1810719811MaRDI QIDQ2872094

Yannik Stein, Wolfgang Mulzer

Publication date: 14 January 2014

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.3452

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (3)

Tolerance for colorful Tverberg partitions ⋮ Robust Tverberg and Colourful Carathéodory Results via Random Choice ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg

This page was built for publication: Algorithms for Tolerated Tverberg Partitions