Journey to the Center of the Point Set

DOI10.4230/LIPIcs.SoCG.2019.41OpenAlexW2953097648MaRDI QIDQ5088971

Mitchell Jones, Sariel Har-Peled

Publication date: 18 July 2022

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/10445/pdf/LIPIcs-SoCG-2019-41.pdf/

zbMATH Keywords

random walkscomputational geometrycenterpoints

Mathematics Subject Classification ID

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

Related Items (1)

No-dimensional Tverberg theorems and algorithms

Cites Work

• Relative \((p,\varepsilon )\)-approximations in geometry
• Approximate centerpoints with proofs
• \(\epsilon\)-nets and simplex range queries
• New constructions of weak \(\varepsilon\)-nets
• Weak \(\varepsilon \)-nets have basis of size \(O(1/\varepsilon\log (1/\varepsilon))\) in any dimension
• On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
• Improved bounds on the sample complexity of learning
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Journey to the Center of the Point Set