Sciweavers

4084 search results - page 423 / 817
» Constraints in spatial structures
Sort
View
EDBT
2006
ACM
154views Database» more  EDBT 2006»
15 years 10 months ago
Approximation Techniques to Enable Dimensionality Reduction for Voronoi-Based Nearest Neighbor Search
Utilizing spatial index structures on secondary memory for nearest neighbor search in high-dimensional data spaces has been the subject of much research. With the potential to host...
Christoph Brochhaus, Marc Wichterich, Thomas Seidl
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
15 years 10 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....
C3S2E
2008
ACM
15 years 8 months ago
Revisiting 2DR-tree insertion
We take another look at the 2DR-tree. In particular, we revisit its node structure, validity rules and the insertion strategy. The 2DR-tree uses 2D nodes so that the relationships...
Marc Moreau, Wendy Osborn
DAGSTUHL
2010
15 years 8 months ago
Towards Automatic Feature-based Visualization
Visualizations are well suited to communicate large amounts of complex data. With increasing resolution in the spatial and temporal domain simple imaging techniques meet their lim...
Heike Jänicke, Gerik Scheuermann
GEOINFO
2003
15 years 8 months ago
Efficient Query Processing on the Relational Quadtree
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...