Journey to the Center of the Point Set

DOI10.4230/LIPICS.SOCG.2019.41OpenAlexW2953097648MaRDI QIDQ5088971FDOQ5088971

Authors: 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

computational geometryrandom walkscenterpoints

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• No-dimensional Tverberg theorems and algorithms

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

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