Algorithms for Radon partitions with tolerance

DOI10.1007/978-3-030-39219-2_38MaRDI QIDQ5896112zbMATH OpenOpenAlexFDO

Authors Sergey Bereg, Mohammadreza Haghpanah

Publication date 21 July 2020

Published in Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-39219-2_38

zbMATH Keywords

linear classifierstoleranceTverberg's theorem

Mathematics Subject Classification ID

Helly-type theorems and geometric transversal theory (52A35) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)

Recommendations

• Algorithms for Radon partitions with tolerance
• ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS
• New lower bounds for Tverberg partitions with tolerance in the plane
• Algorithms for tolerated Tverberg partitions
• Tolerance for colorful Tverberg partitions

Cited in

(4)

• An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets
• A note on the Tolerant Tverberg Theorem
• Algorithms for tolerated Tverberg partitions
• Algorithms for Radon partitions with tolerance

This page was built for publication: Algorithms for Radon partitions with tolerance

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