Active-learning a convex body in low dimensions

DOI10.1007/s00453-021-00807-wOpenAlexW3134288576MaRDI QIDQ2032355

Sariel Har-Peled, Mitchell Jones, Saladi Rahul

Publication date: 11 June 2021

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.03693

zbMATH Keywords

computational geometryapproximation algorithmsactive learningseparation oracles

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Space exploration via proximity search
• Dynamic fractional cascading
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• \(\epsilon\)-nets and simplex range queries
• Computing the volume is difficult
• A generalization of Caratheodory's theorem
• Applications of random sampling in computational geometry. II
• Queries and concept learning
• Metric entropy of some classes of sets with differentiable boundaries
• A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model
• The VC-dimension of K-vertex D-polytopes
• Longest convex chains
• New constructions of weak epsilon-nets
• Geometric median in nearly linear time
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities

This page was built for publication: Active-learning a convex body in low dimensions