ź-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
Journal ArticleDOI
Approximation Algorithms for a k-Line Center
TL;DR: A randomized algorithm that, given P and an ε > 0, computes k cylinders of radius (1 + ε) w* that cover P that is based on sampling and iterated re-weighting for computing the cylinders.
Proceedings ArticleDOI
Approximate testing and learnability
TL;DR: A new measure is defined that is a dual to the VC-dimension, called the testing dimension of a concept class, and it is shown how it yields untestability results for certain concept classes.
Posted Content
Radon numbers and the fractional Helly theorem
Andreas F. Holmsen,Dong-Gyu Lee +1 more
TL;DR: In this paper, a weak epsilon-net theorem for convexity spaces with a bounded Radon number is given, which answers a question of Kalai and extends a recent result of Moran and Yehudayoff.
Book ChapterDOI
The Discrepancy Method in Computational Geometry
TL;DR: This work has shown that virtually all of the important problems in low-dimensional computational geometry can be solved as efficiently deterministically as probabilistically in the area of lower bounds for multidimensional searching.
Proceedings ArticleDOI
Ray shooting in convex polytopes
TL;DR: It is shown that a structure for the ray shooting problem can be dynamically maintained under a sequence of random insertions, using the history of the maintenance process for the polytope as a point location data structure.
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.