2638 search results - page 20 / 528 » Random Geometric Complexes |
CSL
1990
Springer
15 years 6 months ago
1990
Springer
This is an attempt to simplify and justify the notions of deterministicand randomized reductions, an attempt to derive these notions from (more or less) rst principles.
111
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
RANDOM
1997
Springer
15 years 6 months ago
1997
Springer
165
click to vote
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...