ź-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 Article
Covering things with things
Stefan Langerman,Pat Morin +1 more
TL;DR: These algorithms lead to fixed-parameter tractable algorithms for many geometric and non-geometric covering problems.
Journal ArticleDOI
New Constructions of Weak ε-Nets
Jirí Matousek,Uli Wagner +1 more
TL;DR: This paper gives an alternative, and arguably simpler, proof of the fact, first shown by Chazelle et al., that every point set $X$ in $\R^d$ admits a weak $\eps$-net of cardinality $O(\eps^{-d}\polylog(1/\eps))".
Journal ArticleDOI
Domain adaptation---can quantity compensate for quality?
Shai Ben-David,Ruth Urner +1 more
TL;DR: A positive answer is given about under which circumstances large sizes of such training samples can guarantee that the learned classifier preforms just as well as one learned from target generated samples, and this is possible when using a Nearest Neighbor algorithm.
Journal ArticleDOI
Efficient and good Delaunay meshes from random points
Mohamed S. Ebeida,Scott A. Mitchell,Andrew A. Davidson,Anjul Patney,Patrick M. Knupp,John D. Owens +5 more
TL;DR: A Conforming Delaunay Triangulation (CDT) algorithm based on maximal Poisson disk sampling that works well in practice, and has the blue-noise property, and is also fast and uses little memory.
Journal ArticleDOI
Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings
TL;DR: The results improve the deterministic polynomial-time algorithm of Matoušek and Ramos and the optimal but randomized algorithm of Ramos and lead to efficient derandomization of previous algorithms for numerous well-studied problems in computational geometry.
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.