נתן רובין

אקדמי בכיר

Stronger bounds for weak epsilon-nets in higher dimensions

Given a finite point set P in Rd, and >0 we say that N? Rd is a weak -net if it pierces every convex set K with |K P|? ? |P|. Let d? 3. We show that for any finite point set in Rd, and any ?>0, there exist a weak -net of cardinality O(1/?d-1/2+?), where ?>0 is an arbitrary small constant. This is the first improvement of the bound of O?(1/?d) that was obtained in 1993 by Chazelle, Edelsbrunner, Grigni, Guibas, Sharir, and Welzl for general point sets in dimension d? 3.

שפת פרסום אנגלית
דפים 989-1002
סטטוס פרסום פורסם - 15.06.2021

Keywords

computational geometry
convex sets
epsilon-nets
selection theorems

ASJC Scopus subject areas

Software
גישה למסמך
10.1145/3406325.3451062
קבצים וקישורים אחרים
Link to publication in Scopus