Approximate centerpoints with proofs
DOI10.1016/J.COMGEO.2010.04.006zbMATH Open1206.65101OpenAlexW2215397208MaRDI QIDQ991175FDOQ991175
Authors: Donald R. Sheehy, Gary L. Miller 
Publication date: 2 September 2010
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2010.04.006
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing a centerpoint of a finite planar set of points in linear time
- Approximate center points in dense point sets
- A Generalization of Radon's Theorem
- A Theorem on General Measure
- On k-Hulls and Related Problems
- APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Geometric Mesh Partitioning: Implementation and Experiments
- Geometric medians
- Title not available (Why is that?)
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
- Title not available (Why is that?)
- An optimal extension of the centerpoint theorem
- Approximate center points with proofs
- Upper bounds for centerlines
- Approximate center points in dense point sets
- The crossing Tverberg theorem
- The crossing Tverberg theorem
- Tverberg’s theorem is 50 years old: A survey
- Extending the centerpoint theorem to multiple points
- Approximating Tverberg points in linear time for any fixed dimension
- Title not available (Why is that?)
- Journey to the Center of the Point Set
- Algorithms for Radon partitions with tolerance
- Multidimensional agreement in Byzantine systems
- Centerpoints and Tverberg's technique
- ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS
- On strong centerpoints
- 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
Uses Software
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)
