Sciweavers

Share
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
8 years 9 months ago
Lower Bounds for Dynamic Algorithms
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
Michael L. Fredman
SIGGRAPH
1994
ACM
8 years 9 months ago
Fast volume rendering using a shear-warp factorization of the viewing transformation
Several existing volume rendering algorithms operate by factoring the viewing transformation into a 3D shear parallel to the data slices, a projection to form an intermediate but ...
Philippe Lacroute, Marc Levoy
PODS
1993
ACM
122views Database» more  PODS 1993»
8 years 9 months ago
Towards an Analysis of Range Query Performance in Spatial Data Structures
In this paper, we motivate four di erent user de ned window query classes and derive a probabilistic model for each of them. For each model, we characterize the e ciency of spatia...
Bernd-Uwe Pagel, Hans-Werner Six, Heinrich Toben, ...
COMPGEOM
1994
ACM
8 years 9 months ago
Query-Sensitive Ray Shooting
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...
Joseph S. B. Mitchell, David M. Mount, Subhash Sur...
CIKM
1994
Springer
8 years 9 months ago
Hashing by Proximity to Process Duplicates in Spatial Databases
In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures e.g., the quadtree, the cell tree, the R+-tree represent an object by p...
Walid G. Aref, Hanan Samet
PADS
1996
ACM
8 years 9 months ago
Conservative Circuit Simulation on Shared-Memory Multiprocessors
We investigate conservative parallel discrete event simulations for logical circuits on shared-memory multiprocessors. For a first estimation of the possible speedup, we extend th...
Jörg Keller, Thomas Rauber, Bernd Rederlechne...
IPPS
1996
IEEE
8 years 9 months ago
Commutativity Analysis: A Technique for Automatically Parallelizing Pointer-Based Computations
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
Martin C. Rinard, Pedro C. Diniz
COCOON
1998
Springer
8 years 9 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
IPPS
1997
IEEE
8 years 9 months ago
Maintaining Spatial Data Sets in Distributed-Memory Machines
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection tree...
Susanne E. Hambrusch, Ashfaq A. Khokhar
IPPS
1997
IEEE
8 years 9 months ago
d-Dimensional Range Search on Multicomputers
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin...
books