ź-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
Higher Order Function Networks for View Planning and Multi-View Reconstruction
TL;DR: In this article, the authors propose a view planning method for a robot to acquire images of an object for visual inspection and reconstruction, which uses a neural network which encodes shape information for a large number of objects.
Book ChapterDOI
Ham-Sandwich Cuts for Abstract Order Types
Stefan Felsner,Alexander Pilz +1 more
TL;DR: The linear-time ham-sandwich cut algorithm of Lo, Matousek, and Steiger for bi-chromatic finite point sets in the plane works by appropriately selecting crossings of the lines in the dual line arrangement with a set of well-chosen vertical lines as mentioned in this paper.
On indexing large databases for advanced data models
TL;DR: The EPS-tree is an efficient, robust access method for a wide range of problems, based on indexability results, and its success affirms the merits of systematic use of redundancy, and nominates indexability as a prominent methodology.
Posted Content
Bounded VC-dimension implies the Schur-Erdos conjecture.
Jacob Fox,János Pach,Andrew Suk +2 more
TL;DR: The conjecture for $m$-colorings with bounded VC-dimension is proved, that is, for £m- Colorings with the property that the set system $\mathcal{F}$ induced by the neighborhoods of the vertices with respect to each color class has boundedVC-dimension.
Book ChapterDOI
VC-Dimensions for Graphs (Extended Abstract)
TL;DR: A variety of combinatorial and computational results are derived on the VC (Vapnik-Chervonenkis) dimension of set systems induced by special graph properties like clique, connectedness, path, star, tree, etc.
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.