ź-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
BlazeIt: Fast Exploratory Video Queries using Neural Networks.
TL;DR: BLAZEIT, a system that optimizes queries over video for spatiotemporal information of objects and proposes new query optimization techniques uniquely suited to video analytics that are not supported by prior work, is introduced.
Proceedings ArticleDOI
A deterministic linear time algorithm for geometric separators and its applications
TL;DR: The deterministic algorithm hinges on the use of a new method forderiving the separator property of neighborhood systems and answers a majoralgorithmic open question posed by Miller, Teng, Thurston and Vavasis.
Journal ArticleDOI
How hard is half-space range searching?
TL;DR: The results imply the first nontrivial lower bounds for spherical range searching in any fixed dimension and establish a tradeoff between the storagem and the worst-case query timet in the Fredman/Yao arithmetic model of computation.
Book ChapterDOI
Approximately dominating representatives
TL;DR: It is shown that the problem of minimizing the number of points returned, for a user-specified desired approximation, can be solved in polynomial time in two dimensions; for three and more it is NP-hard but has aPolynomial-time logarithmic approximation.
Journal ArticleDOI
An algorithm for generalized point location and its applications
Bernard Chazelle,Micha Sharir +1 more
TL;DR: It is shown that Collins' classical quantifier elimination procedure contains most of the ingredients for an efficient point location algorithm in higher-dimensional space, which leads to a polynomial-size data structure that allows us to locate a point among a collection of real algebraic varieties of constant maximum degree.
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.