ź-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
Proceedings ArticleDOI
Counting circular arc intersections
Pankaj K. Agarwal,Micha Sharir +1 more
TL;DR: If all arcs have the same radius, the (expected) running time can be improved to $O(n^{3/2+\epsilon})$, for any $\ep silon < 0$.
Book ChapterDOI
Computability of convex sets
Martin Kummer,Marcus Schäfer +1 more
TL;DR: In this article, the authors investigated the computability of convex sets restricted to rational inputs, and showed the existence of effective approximations by polygons or effective line intersection tests.
Proceedings ArticleDOI
Beyond the Richter-Thomassen conjecture
TL;DR: This paper proves the following long-standing conjecture of Richter and Thomassen: The total number of intersection points between any n pairwise intersecting simple closed curves in the plane is at least (1 -- o(1))n2.
Posted Content
Problems and results in Extremal Combinatorics -- IV
TL;DR: This paper contains a collection of problems and results in the area, including solutions or partial solutions to open problems suggested by various researchers, including questions in Extremal Graph Theory, Coding Theory and Social Choice.
Posted Content
Diameter computation on $H$-minor free graphs and graphs of bounded (distance) VC-dimension
TL;DR: The approach is based on the work of Chazelle and Welzl who proved the existence of spanning paths with strongly sublinear stabbing number for every hypergraph of constant VC-dimension by combining the best known approximation algorithms for the stabbing number problem with a clever use of $\varepsilon$-nets, region decomposition and other partition techniques.
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.