ź-nets and simplex range queries
Citations
24 citations
24 citations
24 citations
Cites background or result from "ź-nets and simplex range queries"
...Relaxing this requirement a bit, Y is said to be an"-net [ 36 ], [51] of.X;R/ if Y\ R6D; for each R2R such thatjRj >" j Xj. This is clearly a weaker notion than that of an "-approximation, for any "-approximation is automatically an "-net, but the converse need not be true....
[...]
...The study of random sampling in the design of efficient computational geometry methods really began in earnest with some outstanding early work of Clarkson [20], Haussler and Welzl [ 36 ], and Clarkson and Shor [22]....
[...]
...Random sampling can be applied to construct such a partitioning so that each cell intersects at most "n hyperplanes, for " D log r=r [22], [ 36 ]....
[...]
...Interestingly, most of the combinatorial properties needed by geometric random samples can be characterized by two notions—the "-approximation [51], [68] and the"-net [ 36 ], [51]....
[...]
23 citations
23 citations
Additional excerpts
...A seminal result by Haussler and Welzl [16] shows that if VC-dim(Σ) = d, then a random subsetN ⊆ X of sizeO((d/ε) log(d/εδ)) is an ε-net of Σ with probability at least 1 − δ....
[...]
References
3,939 citations
"ź-nets and simplex range queries" refers background or methods or result in this paper
...The drawback is that the constants, if deri~,ed from the results in [ 17 ], can be quite large....
[...]
...More generally, we characterize the classes of ranges for which there exists a function f(E) for e S0 such that any finite point set A has an e-net of size f(e), independently of the size of A. These are precisely the classes of ranges with finite Vapnik-Chervonenkis dimension, known as Vapnik-Chervonenkis classes [ 17 ], [9], [19], [1]....
[...]
...The key concepts and proof techniques of this section are based on the pioneering work of Vapnik and Chervonenkis [ 17 ]....
[...]
...Example 5. Let A be a set of n points in E 2. Since the dimension of (E 2, H~-) is 2, the results in [ 17, Theorem 2 ] show that there exists a 0.01-approximation V of A for positive half-planes (and thus for all half-planes) with I VI = 2,525,039....
[...]
...Using the related notion of an e-approxirnation (directly from [ 17 ]), we also point out trivial data structures of constant size that give approximate solutions to the counting problem for halfspaces in constant time (compare [13])....
[...]
2,284 citations
"ź-nets and simplex range queries" refers background in this paper
...We conclude this section by examining the relationship between the notion of an e-net and the established notion of a centerpoint [21], [11] in combinatorial geometry....
[...]
..., [11] for a general treatment of arrangements....
[...]
1,029 citations
"ź-nets and simplex range queries" refers background in this paper
...Now the assertion can be seen as the dual formulation of Caratheodry's theorem (see [ 15 ], Theorem 2.3.5), which states that if a point x is in the convex hull of a set A in E d, then there exists a subset A' of A such that JA'I -< d + 1 and x is in the convex hull of A'. []...
[...]
555 citations
286 citations
"ź-nets and simplex range queries" refers methods in this paper
...It should be noted that better bounds are possible for reporting in two dimensions (specifically O(log n + t) time, where t is the number of points reported [3]), but these techniques only work for half-planes....
[...]