APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
From MaRDI portal
Publication:5687654
DOI10.1142/S021819599600023XzbMath0859.68114WikidataQ56503423 ScholiaQ56503423MaRDI QIDQ5687654
David Eppstein, Carl Sturtivant, Kenneth L. Clarkson, Gary Lee Miller, Shang-Hua Teng
Publication date: 16 December 1996
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Related Items
Stochastic Tverberg Theorems With Applications in Multiclass Logistic Regression, Separability, and Centerpoints of Data, Dynamic coresets, Optimal outlier removal in high-dimensional spaces, k-Centerpoints Conjectures for Pointsets in ℝd, FAST SOFTWARE FOR BOX INTERSECTIONS, Journey to the Center of the Point Set, Small strong epsilon nets, Support vector machines and Radon's theorem, Helly’s theorem: New variations and applications, Approximating Tverberg points in linear time for any fixed dimension, An optimal extension of the centerpoint theorem, Robust Tverberg and Colourful Carathéodory Results via Random Choice, Centerpoints and Tverberg's technique, Computing the center region and its variants, Unnamed Item, Approximate centerpoints with proofs, Resilient distributed vector consensus using centerpoint, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS, Optimal Algorithms for Geometric Centers and Depth, No-dimensional Tverberg theorems and algorithms
Uses Software
