ź-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
Scalable Spatial Scan Statistics for Trajectories
TL;DR: Several new models for how to define anomalous regions among enormous sets of trajectories are defined, based on spatial scan statistics, and a recent two-level sampling approach is significantly extended which provides high accuracy at enormous scales of data.
Book ChapterDOI
Computational geometry and its application to computer graphics
TL;DR: The area of computational geometry deals with the study of algorithms for problems concerning geometric objects like e.g. lines, polygons, circles, etc. in the plane and in higher-dimensional space.
Posted Content
How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths
TL;DR: In this article, the tracking paths problem is shown to be NP-hard and is known to be solvable in general, but its approximation ratio is unknown, and it is not known whether it can be approximated to within a factor of 1 + ϵ.
Proceedings ArticleDOI
Paul Erdös (1913-996): his influence on the theory of computing
TL;DR: A memorial to Paul Erd6s, whose oeuw-e encompasses a multitude of areas of mathematics, including combinatorics, set theory, number theory, classical analysis, discrete geometry, probability theory, and more.
Posted Content
System of unbiased representatives for a collection of bicolorings
TL;DR: In this article, the minimum cardinality of a set of bicolorings with an unbiased representative in each set of subsets of a bicoloring set was studied, where each set has at least one unbiased representative.
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.