38 Hits in 6.7 sec

Parallel manipulations of octrees and quadtrees [chapter]

Vipin Chaudhary, K. Kamath, P. Arunachalam, J. K. Aggarwal
1992 Lecture Notes in Computer Science  
Octrees o er a powerful means for representing and manipulating 3-D objects. This paper presents an implementation of octree manipulations using a new approach on a shared memory architecture.  ...  Octrees are hierarchical data structures used to model 3-D objects. The manipulation of these data structures involves performing independent computations on each node of the octree.  ...  Results All the algorithms were implemented on the Sequent Balance multiprocessor. We used images of two di erent sizes for timing analysis.  ... 
doi:10.1007/3-540-56346-6_31 fatcat:33cpwbwievdmran7o4rwki3sy4

Efficient parallel algorithms and software for compressed octrees with applications to hierarchical methods

Bhanu Hariharan, Srinivas Aluru
2005 Parallel Computing  
We report experimental results on an IBM SP and a Pentium cluster.  ...  We describe the design and implementation of efficient parallel algorithms, and a software library for the parallel implementation of compressed octree data structures.  ...  Acknowledgements We wish to acknowledge the Ira and Marylou Fulton Supercomputing Center at Brigham Young University for access to the IBM SP parallel computer.  ... 
doi:10.1016/j.parco.2004.12.007 fatcat:bzmexnfudfdrhm2zts2hiimlv4

Efficient Parallel Algorithms and Software for Compressed Octrees with Applications to Hierarchical Methods [chapter]

Bhanu Hariharan, Srinivas Aluru
2001 Lecture Notes in Computer Science  
We report experimental results on an IBM SP and a Pentium cluster.  ...  We describe the design and implementation of efficient parallel algorithms, and a software library for the parallel implementation of compressed octree data structures.  ...  Acknowledgements We wish to acknowledge the Ira and Marylou Fulton Supercomputing Center at Brigham Young University for access to the IBM SP parallel computer.  ... 
doi:10.1007/3-540-45307-5_12 fatcat:335furshcrfrdcyzzz3mw5hrni

Fast volume rendering using a shear-warp factorization of the viewing transformation

Philippe Lacroute, Marc Levoy
1994 Proceedings of the 21st annual conference on Computer graphics and interactive techniques - SIGGRAPH '94  
We describe variants of the algorithm for both parallel and perspective projections and a multiprocessor implementation that achieves frame rates of over 10 Hz.  ...  Early implementations of volume rendering used brute-force techniques that require on the order of 100 seconds to render typical data sets on a workstation.  ...  If the quadtree nodes are opaque then the voxels in the octree node can be culled. The octree and quadtree data structures significantly reduce the complexity of the algorithm.  ... 
doi:10.1145/192161.192283 dblp:conf/siggraph/LacrouteL94 fatcat:yz67q4na75eeben46bou3gwupm

Construction of d-Dimensional Hyperoctrees on a Hypercube Multiprocessor

F. Dehne, A. Fabri, M. Nassar, A. Rauchaplin, R. Valiveti
1994 Journal of Parallel and Distributed Computing  
On a p-processor SIMD hypercube the time complexity o f o u r algorithm is O( m p logp log n), where m is the maximum of input and output size.  ...  We present a parallel algorithm for the construction of the hyperoctree representing a d-dimensional object from a set of n (d ; 1)dimensional hyperoctrees, representing adjacent crossections of this object  ...  Otherwise, r has four children recursively representing the four quadrants of I. We refer to S84] for an overview and bibliography on quadtrees (incl. its many variants) and quadtree applications.  ... 
doi:10.1006/jpdc.1994.1137 fatcat:uqgm7w2c7zbojc7siyirj5jym4

Load Balancing and Data Locality in Adaptive Hierarchical N-Body Methods: Barnes-Hut, Fast Multipole, and Radiosity

J.P. Singh, C. Holt, T. Totsuka, A. Gupta, J. Hennessy
1995 Journal of Parallel and Distributed Computing  
Using a novel partitioning technique, even relatively small problems achieve 45-fold speedups on a 48-processor Stanford DASH machine (a cache-coherent, shared address space multiprocessor) and 118-fold  ...  In this paper, we study the partitioning and scheduling techniques required to obtain effective parallel performance on applications that use a range of hierarchical N-body applications.  ...  Dennis Roger and Eric Bruni developed an initial implementation of the parallel code as a class project at Stanford University.  ... 
doi:10.1006/jpdc.1995.1077 fatcat:xc6rf5l73rchndyvjx6sct7k3i

The Quadtree and Related Hierarchical Data Structures

Hanan Samet
1984 ACM Computing Surveys  
A tutorial survey is presented of the quadtree and related hierarchical data structures. They are based on the principle of recursive decomposition.  ...  The emphasis is on the representation of data used in applications in image processing, computer graphics, geographic information systems, and robotics.  ...  Linn (1973] discusses the use of point quadtrees in a multiprocessor environment.  ... 
doi:10.1145/356924.356930 fatcat:3q363g3xondbjivox43umdusjm

Compression-based ray casting of very large volume data in distributed environments

C. Bajaj, Insung Ihm, Sanghun Park, Dongsub Song
2000 Proceedings Fourth International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region  
We report experimental results on both a Cray T3E and a PC/workstation cluster for the Visible Man dataset.  ...  Our compression-based volume rendering scheme minimizes communications between processing elements during rendering computation, hence is very appropriate for both distributed-memory multiprocessors and  ...  For rendering on each SPE, we use a true volume raycaster, optimized by min-max octree and early ray termination [9] .  ... 
doi:10.1109/hpc.2000.843533 fatcat:p33pz7vsxfgq5gcnkbiawjoc6y

Comparisons of different codes for galacticN-body simulations

P. Fortin, E. Athanassoula, J.-C. Lambert
2011 Astronomy and Astrophysics  
In addition, it is much less sensitive to concentration than other codes, it conserves linear momentum, its computational costs depends roughly linearly on the number of particles, and it allows for manipulators  ...  We wish to help potential users of these codes, particularly less experienced ones, to select the appropriate code by giving them relevant information. Methods.  ...  Rodionov and V. Springel for useful disussions. This work was partially supported by grant ANR-06-BLAN-0172.  ... 
doi:10.1051/0004-6361/201015933 fatcat:cbfn76gi6rgkthj5w3azenbyyu

High-performance quadtree constructions on large-scale geospatial rasters using GPGPU parallel primitives

Jianting Zhang, Simin You
2013 International Journal of Geographical Information Science  
Experiments on 4096*4096 and 16384*16384 raster tiles have shown that the implementation can complete the quadtree constructions in 13.33 milliseconds and 250.75 milliseconds, respectively, on average  ...  The performance of the GPU based implementation also suggests that an indexing rate in the order of more than one billion raster cells per second can be achieved on commodity GPU devices. 4  ...  Acknowledgement This work is supported in part by PSC-CUNY Grants #65692-00 43 and #66724-00 44 an NSF Grant IIS-1302423.  ... 
doi:10.1080/13658816.2013.828840 fatcat:qlmvaqh5szddllqyjf34xzboya

The holodeck ray cache: an interactive rendering system for global illumination in nondiffuse environments

Gregory Ward, Maryann Simmons
1999 ACM Transactions on Graphics  
The display driver creates an image from ray samples sent by the server and permits the manipulation of local objects, which are rendered dynamically using approximate lighting computed from holodeck samples  ...  Ray sample density varies locally according to need, and on-demand ray computation is supported in a parallel implementation.  ...  Thanks to SGI and UCB for funding this work, and permitting us to make the software available as an add-on to LBNL's Radiance rendering package.  ... 
doi:10.1145/337680.337722 fatcat:ku3irrtlibcmpjgilvfsew5znq

The Holodeck interactive ray cache

Gregory Ward Larson, Maryann Simmons
1999 ACM SIGGRAPH 99 Conference abstracts and applications on - SIGGRAPH '99  
With the exception of Pighin's and Bala's work, none of these methods make use of an on-line ray tracer or other sample generator to refine the displayed image.  ...  Typical holodeck files range from 50 Mbytes to 1 Gbyte, depending on resolution and the number of sections.  ...  Thanks to SGI and ONR (MURI grant #FDN00014-96-1-1200) for funding this work, and permitting us to make the software available as an add-on to LBNL's Radiance rendering package.  ... 
doi:10.1145/311625.312142 dblp:conf/siggraph/LarsonS99 fatcat:xonxm2r46rczrizywxlvm2ibva

Low-complexity maximum intensity projection

Benjamin Mora, David S. Ebert
2005 ACM Transactions on Graphics  
Here, we fully model and analyze the use of octrees for MIP, and we mathematically show that the average MIP complexity can be reduced to O(n 2 ) for an object-order algorithm, or to O(log(n)) per ray  ...  It is based on hierarchical occlusion maps that perform on-the-fly visibility of the data, and our results show that it is the most efficient solution for MIP available to date.  ...  The Xmas Tree was generated from a real-world Christmas tree by the Department of Radiology, University of Vienna, and the Institute of Computer Graphics and Algorithms, Vienna University of Technology  ... 
doi:10.1145/1095878.1095886 fatcat:hoffokq5kvfhxelnp22bpfn5he

Hierarchical Modeling of Multidimensional Data in Regularly Decomposed Spaces: Main Principles [article]

Olivier Guye
2016 arXiv   pre-print
These tools are relying on the principle of regular hierarchical decomposition and led to the implementation of a multidimensional generalization of quaternary and octernary trees: the trees of order 2  ...  of a tree ; - the attribute calculus based on generalized moments and the provision of Eigen trees ; - perception procedures of objects without any covering in affine geometry ; - several supervised and  ...  MEAGHER: Octree Generation, Analysis and Manipulation; IPL -TR - 82-027, Image Processing Lab., Electrical and Systems Engineering Dept., Rensselaer Polytechnic Institute, April 1982.  ... 
arXiv:1605.00961v2 fatcat:oe32nsakarcmfnqm4lsv7uiwqu

Real-time physics data-visualization system using Performer

Chris Mitchell, Walter Gekelman
1998 Computers in physics  
The graphics component employs strategic visual database decomposition and levels of detail to maintain a fast frame rate. This allows one to navigate through the data sets as they evolve temporally.  ...  On the computational side, the system calculates vector fields, streamlines, isosurfaces, and cutplanes in real time.  ...  The octree approach (quadtree in this example) makes the determination of which squares to subdivide equivalent to a tree search.  ... 
doi:10.1063/1.168690 fatcat:z4wo4a6wy5fulowhsoohtbiuou
« Previous Showing results 1 — 15 out of 38 results