ź-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
Optimal Randomized Parallel Algorithms for Computational Geometry I
H J Reif,Sandeep Sen +1 more
TL;DR: In this paper, the authors present parallel algorithms for 3-D maxima and two-set dominance counting by an application of integer sorting, which have running time of O(logn)$ using $n$ processors, with very high probability.
Book ChapterDOI
I/O-efficient construction of constrained delaunay triangulations
TL;DR: This paper designed and implemented an I/O-efficient algorithm for constructing constrained Delaunay triangulations and shows that the algorithm is significantly faster than existing implementations.
Proceedings ArticleDOI
Efficient ray shooting and hidden surface removal
TL;DR: This paper studies the ray-shooting problem for three special classes of polyhedral objects in space: axis-parallel polyhedra, curtains, and fat horizontal triangles, and presents a structure that usesOn4+ɛ) preprocessing and has a query time ofO(logn).
Proceedings ArticleDOI
Vertical decompositions for triangles in 3-space
TL;DR: A deterministic output-sensitive algorithm for computing the vertical decomposition of a set of n triangles in three-dimensional space is given that tries to perform as much of the computation in two-dimensional spaces as possible and thus is a good candidate for efficient implementations.
Proceedings ArticleDOI
Almost optimal set covers in finite VC-dimension: (preliminary version)
TL;DR: A deterministic polynomial time method for finding a set cover in a set system of VC-dimension such that the size of the cover is at most a factor of O(c) from the optimal size, and it is shown that in some cases, such as those that arise in 3-d polytope approximation and 2-d disc covering, the authors can quickly find O-sized covers.
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.