ź-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 survey of mass partitions
TL;DR: A survey of recent progress in the area can be found in this paper, along with connections to topology, discrete geometry, and computer science, as well as a discussion of the connections between topology and discrete geometry.
Journal ArticleDOI
Scalable Spatial Scan Statistics for Trajectories
TL;DR: In this article, the authors define several new models for how to define anomalous regions among enormous sets of trajectories, which are based on spatial scan statistics, and identify a geometric region which captures a subset of trajectory which are significantly different in a measured characteristic from the background population.
Journal ArticleDOI
Lower bounds for weak epsilon-nets and stair-convexity
TL;DR: This work constructs sets X ⊂ ℝd for which every weak 1/r -net has at least Ω(r logd−1r) points; this is the first superlinear lower bound for weak ɛ-nets in a fixed dimension.
Proceedings ArticleDOI
SDR approximation bounds for the robust multicast beamforming problem with interference temperature constraints
TL;DR: This work considers the robust beamforming design for secondary downlink multicasting channels, where primary users are present with norm-bounded channel errors and shows that the SDR solution achieves an objective value that is at least Ω(1/MN log J) times the optimal objective value.
Dissertation
Solving Geometric Problems in Space-Conscious Models
TL;DR: This thesis designs efficient algorithms in space-conscious models of in-place algorithms, multi-pass algorithms, read-only algorithms, and stream-sort algorithms,and the focus is on fundamental geometric problems, such as 2D convex hulls, 3D conveX Hulls, Voronoi diagrams and nearest neighbor queries, Klee’s measure problem, and low-dimensional linear programming.
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.