ź-nets and simplex range queries
David Haussler,Emo Welzl +1 more
Reads0
Chats0
TLDR
The concept of an ɛ-net of a set of points for an abstract set of ranges is introduced and sufficient conditions that a random sample is an Â-net with any desired probability are given.Abstract:
We demonstrate the existence of data structures for half-space and simplex range queries on finite point sets ind-dimensional space,dÂ?2, with linear storage andO(nÂ?) query time, $$\alpha = \frac{{d(d - 1)}}{{d(d - 1) + 1}} + \gamma for all \gamma > 0$$ .
These bounds are better than those previously published for alldÂ?2. Based on ideas due to Vapnik and Chervonenkis, we introduce the concept of an Â?-net of a set of points for an abstract set of ranges and give sufficient conditions that a random sample is an Â?-net with any desired probability. Using these results, we demonstrate how random samples can be used to build a partition-tree structure that achieves the above query time.read more
Citations
More filters
Posted Content
From a $(p,2)$-Theorem to a Tight $(p,q)$-Theorem
Chaya Keller,Shakhar Smorodinsky +1 more
TL;DR: A general method is presented which allows using a $( p,2)-theorem as a bootstrapping to obtain a tight $(p,q)$-theorems, for families with Helly number 2, even without assuming that the sets in the family are convex or compact.
Proceedings ArticleDOI
Bounded VC-Dimension Implies the Schur-Erdős Conjecture
Jacob Fox,János Pach,Andrew Suk +2 more
TL;DR: For m-coloring with bounded VC-dimension, this paper showed that r(3;m) ≥ 2^Ω(m) and showed that the set system induced by the neighborhoods of the vertices with respect to each color class has bounded VC dimension.
Proceedings ArticleDOI
Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model
TL;DR: The approach is based on a primal-dual range searching mechanism, which exploits the multi-level polynomial partitioning machinery recently developed by Agarwal, Aronov, Ezra, and Zahl (2020).
Posted Content
How to Net a Convex Shape.
Sariel Har-Peled,Mitchell Jones +1 more
TL;DR: This work presents a construction of weak $\eps$-nets which have the following additional property: For a heavy body, there is a net point that stabs the body, and it is a good centerpoint for the points contained inside the body.
Proceedings Article
A new lower bound on Hadwiger-Debrunner numbers in the plane
Chaya Keller,Shakhar Smorodinsky +1 more
TL;DR: The best known lower bound on the Hadwiger-Debrunner numbers in the plane is [MATH as mentioned in this paper, which is tight for all families that have a bounded VC-dimension.
References
More filters
Book ChapterDOI
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
TL;DR: This chapter reproduces the English translation by B. Seckler of the paper by Vapnik and Chervonenkis in which they gave proofs for the innovative results they had obtained in a draft form in July 1966 and announced in 1968 in their note in Soviet Mathematics Doklady.
Book
Algorithms in Combinatorial Geometry
TL;DR: This book offers a modern approach to computational geo- metry, an area thatstudies the computational complexity of geometric problems with an important role in this study.
Journal ArticleDOI
On the density of families of sets
TL;DR: This paper will answer the question in the affirmative by determining the exact upper bound of T if T is a family of subsets of some infinite set S then either there exists to each number n a set A ⊂ S with |A| = n such that |T ∩ A| = 2n or there exists some number N such that •A| c for each A⩾ N and some constant c.
Journal ArticleDOI
Central Limit Theorems for Empirical Measures
TL;DR: In this article, the convergence of a stochastic process indexed by a Gaussian process to a certain Gaussian processes indexed by the supremum norm was studied in a Donsker class.
Journal ArticleDOI
The power of geometric duality
TL;DR: A new formulation of the notion of duality that allows the unified treatment of a number of geometric problems is used, to solve two long-standing problems of computational geometry and to obtain a quadratic algorithm for computing the minimum-area triangle with vertices chosen amongn points in the plane.