ź-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
A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension
TL;DR: This paper shows that there exists a coloring $\chi$ with discrepancy bound O^{*}(|S|^{1/2 - d_1/(2d)} n^{(d_1 - 1)/(2d)})$, for each $S \in \EuScript{S}$, where $O^{*](\cdot)$ hides a polylogarithmic factor in $n$.
Journal ArticleDOI
On the approximability of covering points by lines and related problems
Adrian Dumitrescu,Minghui Jiang +1 more
TL;DR: In this paper, a lower bound of O( log n ) on the approximation ratio of the greedy algorithm for Covering Points by Lines was shown. But the current best approximation ratio for CPL is still O(log n ), which is still polynomial-time APX-hard unless P = NP.
Journal ArticleDOI
Segment Intersection Searching Problems in General Settings
TL;DR: An efficient data structure is obtained for the triangular windowing problem, which is a generalization of triangular range searching, and the first substantially subquadratic algorithm for a red—blue intersection counting problem is derived.
Journal ArticleDOI
Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima
Neelima Gupta,Sandeep Sen +1 more
TL;DR: An optimal speed-up (with respect to the input size only) sublogarithmic time algorithm that uses superlinear number of processors for vector maxima in three dimensions that is faster than previously known algorithms.
Journal ArticleDOI
On Separating Points by Lines
Sariel Har-Peled,Mitchell Jones +1 more
TL;DR: This work shows that the minimum number of lines needed to separate n points, picked randomly (and uniformly) in the unit square, is$$Bigl .{\widetilde{\Theta }}( n^{2/3})$$ and provides a fast O ( log ( sep P ) ) -approximation algorithm for computing the separability of a given point set in the 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.