Algorithms for center and Tverberg points
From MaRDI portal
Recommendations
- Algorithms for center and Tverberg points
- Centerpoints and Tverberg's technique
- Algorithms for computing centroids
- An Algorithm for the p-Center Problem in the Plane
- Polynomial algorithms for center location on spheres
- scientific article; zbMATH DE number 4213496
- Approximation algorithms for orthogonal line centers
- Approximation algorithms for orthogonal line centers
- Efficient algorithms for computing one or two discrete centers hitting a set of line segments
- Computing a centerpoint of a finite planar set of points in linear time
Cited in
(12)- An algorithm for finding the Chebyshev center of a convex polyhedron
- Algorithms for crossover point determination
- scientific article; zbMATH DE number 4213496 (Why is no real title available?)
- On Center Regions and Balls Containing Many Points
- Algorithms for center and Tverberg points
- Algorithmic Derivation of Centre Conditions
- Approximating Tverberg points in linear time for any fixed dimension
- Approximating Tverberg points in linear time for any fixed dimension
- Multidimensional agreement in Byzantine systems
- Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\)
- Centerpoints and Tverberg's technique
- Approximate centerpoints with proofs
This page was built for publication: Algorithms for center and Tverberg points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361655)
