Sciweavers

198 search results - page 6 / 40
» Dynamic spatial approximation trees
Sort
View
EJWCN
2010
118views more  EJWCN 2010»
13 years 4 months ago
Spatial Dynamics of Indoor Radio Wideband Channels
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...
Dana Porrat, Aawatif Menouni Hayar, Yuval Serfaty
COMPGEOM
2010
ACM
14 years 2 months ago
A dynamic data structure for approximate range searching
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 ...
David M. Mount, Eunhui Park
SMI
2005
IEEE
140views Image Analysis» more  SMI 2005»
14 years 3 months ago
Interactive Implicit Modeling with Hierarchical Spatial Caching
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...
Ryan Schmidt, Brian Wyvill, Eric Galin
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
14 years 3 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
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 ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
WAIM
2007
Springer
14 years 3 months ago
An Efficient Spatial Search Method Based on SG-Tree
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 ...
Yintian Liu, Changjie Tang, Lei Duan, Tao Zeng, Ch...