A simple sampling lemma: Analysis and applications in geometric optimization

DOI10.1007/s00454-001-0006-2zbMath0984.68173DBLPjournals/dcg/GartnerW01OpenAlexW2125028780WikidataQ54308986 ScholiaQ54308986MaRDI QIDQ5939470

Ermo Welzl, Bernd Gärtner

Publication date: 14 May 2002

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

Full work available at URL: https://doi.org/10.1007/s00454-001-0006-2

zbMATH Keywords

random samplingsampling lemma

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

Clarkson's algorithm for violator spaces ⋮ Random sampling with removal ⋮ Provably fast training algorithms for support vector machines ⋮ Violator spaces: Structure and algorithms ⋮ Learning noisy functions via interval models

Uses Software

• Miniball

This page was built for publication: A simple sampling lemma: Analysis and applications in geometric optimization