Approximating Tverberg points in linear time for any fixed dimension

DOI10.1007/S00454-013-9528-7MaRDI QIDQ5891192zbMATH OpenOpenAlexFDO

Authors Wolfgang Mulzer, Daniel Werner

Publication date 23 September 2013

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00454-013-9528-7

zbMATH Keywords

discrete geometryapproximationhigh dimensioncenterpointTverberg theorem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Computational aspects related to convexity (52B55) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Approximating Tverberg points in linear time for any fixed dimension
• ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS
• Algorithms for tolerated Tverberg partitions
• Approximate centerpoints with proofs
• Algorithms for center and Tverberg points

Cites work

• scientific article; zbMATH DE number 5999585 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 1528185 (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
• A further generalization of the colourful Carathéodory theorem
• APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
• Algorithms for center and Tverberg points
• Approximate centerpoints with proofs
• Computing a centerpoint of a finite planar set of points in linear time
• Geometric algorithms and combinatorial optimization.
• Introduction to algorithms.
• On the complexity of the parity argument and other inefficient proofs of existence

Cited in

(20)

• Algorithms for center and Tverberg points
• Stochastic Tverberg theorems with applications in multiclass logistic regression, separability, and centerpoints of data
• No-dimensional Tverberg theorems and algorithms
• Approximate centerpoints with proofs
• Approximate center points with proofs
• Algorithms for tolerated Tverberg partitions
• The crossing Tverberg theorem
• Tverberg theorems over discrete sets of points
• Tverberg’s theorem is 50 years old: A survey
• The crossing Tverberg theorem
• Approximating Tverberg points in linear time for any fixed dimension
• Algorithms for Radon partitions with tolerance
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
• ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS
• Computational aspects of the colorful Carathéodory theorem
• Resilient distributed vector consensus using centerpoint
• Helly’s theorem: New variations and applications
• No-dimensional Tverberg Theorems and Algorithms
• Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey
• An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets

This page was built for publication: Approximating Tverberg points in linear time for any fixed dimension

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