APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS

DOI10.1142/S021819599600023XMaRDI QIDQ5687654zbMATH OpenWikidataFDO

Authors Kenneth L. Clarkson, David Eppstein, C. Sturtivant, Gary L. Miller, Shang-Hua Teng

Publication date 16 December 1996

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S021819599600023X

zbMATH Keywords

Monte Carlo algorithm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Approximate centerpoints with proofs
• Approximate center points with proofs
• Approximate center points in dense point sets
• Computing a centerpoint of a finite planar set of points in linear time

Cited in

(27)

• Optimal outlier removal in high-dimensional spaces
• Resilient distributed vector consensus using centerpoint
• No-dimensional Tverberg theorems and algorithms
• Approximate center points in dense point sets
• Helly’s theorem: New variations and applications
• scientific article; zbMATH DE number 5608585 (Why is no real title available?)
• \(k\)-centerpoints conjectures for pointsets in \(\mathbb{R}^d\)
• Small strong epsilon nets
• scientific article; zbMATH DE number 1526594 (Why is no real title available?)
• Weighted SGD for _p regression with randomized preconditioning
• Robust Tverberg and Colourful Carathéodory Results via Random Choice
• FAST SOFTWARE FOR BOX INTERSECTIONS
• Journey to the Center of the Point Set
• Stochastic Tverberg theorems with applications in multiclass logistic regression, separability, and centerpoints of data
• Journey to the Center of the Point Set
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
• ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS
• Approximate center points with proofs
• Optimal algorithms for geometric centers and depth
• Approximating Tverberg points in linear time for any fixed dimension
• Support vector machines and Radon's theorem
• No-dimensional Tverberg partitions revisited
• No-dimensional Tverberg partitions revisited
• Dynamic coresets
• An optimal extension of the centerpoint theorem
• Centerpoints and Tverberg's technique
• Approximate centerpoints with proofs

Describes a project that uses

Uses Software

• MESHPART

This page was built for publication: APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5687654)