ź-nets and simplex range queries
David Haussler,Emo Welzl +1 more
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
Active and passive learning of linear separators under log-concave distributions
TL;DR: In this paper, it was shown that active learning provides an exponential improvement over PAC (passive) learning of homogeneous linear separators under nearly log-concave distributions.
Posted Content
Improved Approximation Algorithms for Geometric Set Cover
TL;DR: In this article, it was shown that for a random subset R of S and function f, there is a decomposition of the portion of U not covered by R into an expected f(|R|) regions, each region of a particular simple form.
Book
Partitioning Arrangements of Lines: II. Applications
TL;DR: An algorithm that preprocesses a set ofn points in the plane, into a data structure of sizeO(m) forn logn≤m≤n2, so that the number of points ofS lying inside a query triangle can be computed inO((n/√m) log3/2n) time.
Proceedings ArticleDOI
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
TL;DR: This work shows that the combinatorial complexity of the vertical decomposition of the ${\le}k-level of the arrangement of the bivariate algebraic functions of constant maximum degree is $O(k^{3+\varepsilon}\psi({n/k}))', which implies the existence of shallow cuttings of small size in arrangements of bivariategebraic functions.
Journal ArticleDOI
Efficient randomized algorithms for some geometric optimization problems
Pankaj K. Agarwal,Micha Sharir +1 more
TL;DR: A general technique that yields faster randomized algorithms for solving a number of geometric optimization problems, including computing the width of a point set in 3-space, computing the minimum-width annulus enclosing a set ofn points in the plane, and computing the “biggest stick” inside a simple polygon inThe plane.
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.