Sciweavers

CGF
2010
181views more  CGF 2010»
13 years 3 months ago
Matrix Trees
Recent advances in GPU programmability and architecture have allowed for the generation of ray casted or ray traced images at interactive rates. How quickly these images can be ge...
Nathan Andrysco, Xavier Tricoche
DMIN
2006
109views Data Mining» more  DMIN 2006»
13 years 6 months ago
Revised Aggregation-tree Used in Metadata Extraction from SVG Images
Many of the multimedia researchers have focused on the issue of the retrieval of images using indexed image collections. A number of spatial data structures based on Minimum Bound...
Shuju Bai, Abdus Salam, Ebrahim Khosravi
VLDB
1995
ACM
121views Database» more  VLDB 1995»
13 years 8 months ago
Benchmarking Spatial Join Operations with Spatial Output
The spatial join operation is benchmarked using variants of well-known spatial data structures such as the R-tree, R-tree, R+-tree, and the PMR quadtree. The focus is on a spatia...
Erik G. Hoel, Hanan Samet
PODS
1995
ACM
124views Database» more  PODS 1995»
13 years 8 months ago
Window Query-Optimal Clustering of Spatial Objects
During the last decade various spatial data structures have been designed and compared against each other with respect to their performance. Still missing is a lower bound result,...
Bernd-Uwe Pagel, Hans-Werner Six, Mario Winter
IGIS
1994
156views GIS» more  IGIS 1994»
13 years 8 months ago
Optimizing Spatial Data Structures For Static Data
During the last decade various spatial data structures have been designed and compared against each other, all of them re ecting a dynamic situation with ongoing object insertion a...
Lukas Bachmann, Bernd-Uwe Pagel, Hans-Werner Six
ICPP
1994
IEEE
13 years 8 months ago
Data-Parallel Spatial Join Algorithms
E cient data-parallel spatial join algorithms for pmr quadtrees and R-trees, common spatial data structures, are presented. The domain consists of planar line segment data i.e., Bu...
Erik G. Hoel, Hanan Samet
SI3D
2005
ACM
13 years 10 months ago
Broad-phase collision detection using semi-adjusting BSP-trees
The broad-phase step of collision detection in scenes composed of n moving objects is a challenging problem because enumerating collision pairs has an inherent O(n2) complexity. S...
Rodrigo G. Luque, João Luiz Dihl Comba, Car...