Approximate centerpoints with proofs
From MaRDI portal
Approximation algorithms (68W25) Computer-aided design (modeling of curves and surfaces) (65D17) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50)
Recommendations
Cites work
- scientific article; zbMATH DE number 1643846 (Why is no real title available?)
- scientific article; zbMATH DE number 2068057 (Why is no real title available?)
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- scientific article; zbMATH DE number 3214278 (Why is no real title available?)
- scientific article; zbMATH DE number 6469174 (Why is no real title available?)
- A Generalization of Radon's Theorem
- A Theorem on General Measure
- APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
- Approximate center points in dense point sets
- Computing a centerpoint of a finite planar set of points in linear time
- Geometric Mesh Partitioning: Implementation and Experiments
- Geometric medians
- On k-Hulls and Related Problems
Cited in
(25)- Stochastic Tverberg theorems with applications in multiclass logistic regression, separability, and centerpoints of data
- No-dimensional Tverberg theorems and algorithms
- Small strong epsilon nets
- scientific article; zbMATH DE number 6801906 (Why is no real title available?)
- An optimal extension of the centerpoint theorem
- Upper bounds for centerlines
- Approximate center points with proofs
- Approximate center points in dense point sets
- The crossing Tverberg theorem
- Tverberg’s theorem is 50 years old: A survey
- The crossing Tverberg theorem
- Extending the centerpoint theorem to multiple points
- scientific article; zbMATH DE number 1526594 (Why is no real title available?)
- Approximating Tverberg points in linear time for any fixed dimension
- Multidimensional agreement in Byzantine systems
- Journey to the Center of the Point Set
- Algorithms for Radon partitions with tolerance
- Centerpoints and Tverberg's technique
- On strong centerpoints
- ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS
- No dice: a deterministic approach to the Cartan centroid
- The center problem via averaging method
- Computational aspects of the colorful Carathéodory theorem
- Resilient distributed vector consensus using centerpoint
- Approximating Tverberg points in linear time for any fixed dimension
This page was built for publication: Approximate centerpoints with proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991175)