New applications of random sampling in computational geometry
Citations
153 citations
Cites methods from "New applications of random sampling..."
...In the context of partition trees such a construction was introduced in Dobkin and Edelsbrunner [1987]. Recently it has been used quite frequently, e....
[...]
...In the context of partition trees such a construction was introduced in Dobkin and Edelsbrunner [1987]. Recently it has been used quite frequently, e.g., see Overmars et al. [1990], Chazelle et al....
[...]
152 citations
Cites background from "New applications of random sampling..."
...Since no cell of ~'~r intersects any surface of ~ in its interior, and since each such cell is defined in terms of only a constant number of surfaces of Z, it follows, using standard probabilistic arguments [10], [23], that, with high probability, no cell of J [ ) intersects in its interior more than O((n/r) log r) surfaces of E....
[...]
149 citations
142 citations
Cites methods from "New applications of random sampling..."
...A simple random sampling algorithm was suggested by Clarkson [11]....
[...]
141 citations
Cites background from "New applications of random sampling..."
...In the mid 80's Ken Clarkson started to create and apply his random sampling technique, which in the mean time has developed into a surprising general framework with numerous applications [15, 16, 17, 18]....
[...]
References
17,939 citations
6,525 citations
"New applications of random sampling..." refers background in this paper
...(In fact the mapping γ is not unique in this regard: see [13, 23, 2]....
[...]
3,939 citations
"New applications of random sampling..." refers background in this paper
...Vapnik and Chervonenkis [27] have derived general conditions under which several probabilities may be uniformly estimated using one random sample....
[...]
3,419 citations