198 search results - page 6 / 40 » Dynamic spatial approximation trees |
103
click to vote
EJWCN
2010
14 years 4 months ago
2010
Abstract--The multipath components of super-wideband (217.2 GHz) non line of sight channel responses measured inside several buildings are stable along sections that are 27 cm long...
128
click to vote
COMPGEOM
2010
ACM
15 years 2 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 ...
SMI
2005
IEEE
15 years 3 months ago
2005
IEEE
Complex implicit CSG models can be represented hierarchically as a tree of nodes (the BlobTree) . However, current methods cannot be used to visualize changes made to these models...
ESA
2005
Springer
15 years 2 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
WAIM
2007
Springer
15 years 3 months ago
2007
Springer
To solve the overlapping search of multidimensional spatial database containing large quantity of objects with dynamic spatial extent, this paper proposes an index structure named ...