ź-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
Book ChapterDOI
Automatic Mesh Partitioning
TL;DR: An efficient approach to partitioning unstructured meshes that occur naturally in the finite element and finite difference methods that makes use of the underlying geometric structure of a given mesh and finds a provably good partition in random O(n) time is described.
Proceedings ArticleDOI
Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane and related problems
TL;DR: An optimal parallel randomized algorithm for the Voronoi diagram of a set of non-intersecting line segments in the plane using efficient randomized search techniques and random sampling at “two stages” of the algorithm.
Book ChapterDOI
Geometric Set Systems
TL;DR: This work considers the set system on X whose sets are all intersections of X with a halfplane, and focuses on applications in discrepancy theory, in combinatorial geometry, in derandomization of geometric algorithms, and in geometric range searching.
Proceedings ArticleDOI
Efficient Beacon Placement Algorithms for Time-of-Flight Indoor Localization
TL;DR: This paper proposes two beacon placement algorithms that leverage the floor plan geometry with provable theoretical guarantees and presents a greedy algorithm using properties of sub-modular functions to place O(OPT · ln m) beacons, where m is the number of discrete location points in the region that need to be localized, and OPT is the size of the optimal solution.
Journal ArticleDOI
Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting
TL;DR: This work proposes an alternative approach to the range-minimum problem, based on cuttings, which achieves better performance and uses, for each permutation, O(n⌊d/2⌋(log’slog n)c/log”n) expected storage and preprocessing time, for some constant c, and answers a range- minimum query in O(log n) expected time.
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.