Approximating Tverberg points in linear time for any fixed dimension
DOI10.1007/S00454-013-9528-7zbMATH Open1298.68281OpenAlexW2086902521MaRDI QIDQ5891192FDOQ5891192
Authors: Wolfgang Mulzer, Daniel Werner 
Publication date: 23 September 2013
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-013-9528-7
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Computational aspects related to convexity (52B55) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Introduction to algorithms.
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization.
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the complexity of the parity argument and other inefficient proofs of existence
- Computing a centerpoint of a finite planar set of points in linear time
- A Generalization of Radon's Theorem
- A Theorem on General Measure
- Title not available (Why is that?)
- APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
- Approximate centerpoints with proofs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A further generalization of the colourful Carathéodory theorem
- Algorithms for center and Tverberg points
Cited In (20)
- Algorithms for center and Tverberg points
- Stochastic Tverberg theorems with applications in multiclass logistic regression, separability, and centerpoints of data
- No-dimensional Tverberg theorems and algorithms
- Approximate center points with proofs
- Approximate centerpoints with proofs
- Algorithms for tolerated Tverberg partitions
- The crossing Tverberg theorem
- Tverberg theorems over discrete sets of points
- The crossing Tverberg theorem
- Tverberg’s theorem is 50 years old: A survey
- Approximating Tverberg points in linear time for any fixed dimension
- Algorithms for Radon partitions with tolerance
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS
- Computational aspects of the colorful Carathéodory theorem
- Resilient distributed vector consensus using centerpoint
- Helly’s theorem: New variations and applications
- No-dimensional Tverberg Theorems and Algorithms
- Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey
- An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets
This page was built for publication: Approximating Tverberg points in linear time for any fixed dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5891192)
