No-dimensional Tverberg theorems and algorithms
From MaRDI portal
Publication:2105318
DOI10.1007/s00454-022-00380-1OpenAlexW2960997452WikidataQ113905012 ScholiaQ113905012MaRDI QIDQ2105318
Wolfgang Mulzer, Aruni Choudhary
Publication date: 8 December 2022
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.04284
Cites Work
- Unnamed Item
- Unnamed Item
- Equal coefficients and tolerance in coloured Tverberg partitions
- Generalized ham-sandwich cuts
- A geometric proof of the colored Tverberg theorem
- Approximate centerpoints with proofs
- A generalization of Caratheodory's theorem
- The colored Tverberg's problem and complexes of injective functions
- On generalizations of Radon's theorem and the Ham sandwich theorem
- Tverberg's theorem via number fields
- Computational aspects of the colorful Carathéodory theorem
- Optimal bounds for the colored Tverberg problem
- Very colorful theorems
- Slicing convex sets and measures by a hyperplane
- Generalized sandwich theorems
- Tverberg's Theorem at 50: Extensions and Counterexamples
- An Extension of the Ham Sandwich Theorem
- A generalization of Radon's theorem II
- A Colored Version of Tverberg's Theorem
- Colourful Linear Programming and its Relatives
- The Rainbow at the End of the Line — A PPAD Formulation of the Colorful Carathéodory Theorem with Applications
- Journey to the Center of the Point Set
- The complexity of splitting necklaces and bisecting ham sandwiches
- Theorems of Carathéodory, Helly, and Tverberg without dimension
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS
- A Generalization of Radon's Theorem
- Algorithmic Game Theory
- APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
- A Theorem on General Measure
- Approximating Tverberg points in linear time for any fixed dimension
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
- Partitions of points into simplices with \(k\)-dimensional intersection. I: The conic Tverberg's theorem
- No-dimensional Tverberg Theorems and Algorithms
This page was built for publication: No-dimensional Tverberg theorems and algorithms
