Proceedings of 1993 IEEE Parallel Rendering Symposium

25-26 Oct. 1993

Filter Results

Displaying Results 1 - 17 of 17
  • Author index

    Publication Year: 1993, Page(s): 0_2
    Cited by:  Papers (2)
    Request permission for commercial reuse | PDF file iconPDF (35 KB)
    Freely Available from IEEE
  • Proceedings of 1993 IEEE Parallel Rendering Symposium

    Publication Year: 1993
    Request permission for commercial reuse | PDF file iconPDF (213 KB)
    Freely Available from IEEE
  • A data distributed, parallel algorithm for ray-traced volume rendering

    Publication Year: 1993, Page(s):15 - 22, 105
    Cited by:  Papers (30)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (820 KB)

    This paper presents a divide-and-conquer ray-traced volume rendering algorithm and a parallel image compositing method, along with their implementation and performance on the Connection Machine CM-5, and networked workstations. This algorithm distributes both the data and the computations to individual processing units to achieve fast, high-quality rendering of high-resolution data. The volume dat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Segmented ray casting for data parallel volume rendering

    Publication Year: 1993, Page(s):7 - 14
    Cited by:  Papers (37)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (892 KB)

    Interactive volume rendering is important to the timely analysis of three-dimensional data, but workstations take seconds to minutes to render data sets of a few megabytes. We have developed a parallel ray-casting technique, called Segmented Ray Casting, which can render a 128×128×128 data set at 2-3 frames per second on a 4K processor DECmpp 1200/Sx Model 100. Pixel values in the imag... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient parallel ray tracing scheme for distributed memory parallel computers

    Publication Year: 1993, Page(s):77 - 80
    Cited by:  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    The ray-tracing algorithm produces high quality images by taking multiple luminous effects into account. Hence, it requires many computations and a large memory capacity. The use of parallel machines is a solution in order to reduce significantly the synthesis time. Distributed Memory Parallel Computers offer an interesting performance/cost ratio but need to distribute computations and data. This ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Progressive refinement radiosity on ring-connected multicomputers

    Publication Year: 1993, Page(s):71 - 76
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    The progressive refinement method is investigated for parallelization on ring-connected multicomputers. A synchronous scheme, based on static task assignment, is proposed, in order to achieve better coherence during the parallel light distribution computations. An efficient global circulation scheme is proposed for the parallel light distribution computations, which reduces the total volume of con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A task adaptive parallel graphics renderer

    Publication Year: 1993, Page(s):27 - 34, 107
    Cited by:  Papers (6)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB)

    This paper presents a graphics renderer which incorporates new partitioning methodologies of memory and work for efficient execution on a parallel computer. The task adaptive domain decomposition scheme is an image space method involving dynamic partitioning of rectangular pixel area tasks. We show that this method requires little overhead, allows coherence within a parallel context, handles worst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrating volume data analysis and rendering on distributed memory architectures

    Publication Year: 1993, Page(s):89 - 96, 112
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (820 KB)

    The ability to generate visual representations of data, and the ability to enhance data into a suitable form for the purpose of visual representation, form two key components in a scientific visualization system. By a visual representation we mean the ability to render the data, using visual cues, such that the important features are readily perceived by the user. By the ability to enhance data we... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multicomputer polygon rendering algorithm for interactive applications

    Publication Year: 1993, Page(s):43 - 48, 109
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    This paper presents a new multicomputer polygon rendering algorithm that is specialized for interactive applications. The algorithm differs from previous algorithms in two ways. First, it load balances the rasterization once per frame, instead of as the frame progresses, using the previous frame's distribution of polygons on the screen as input to the load-balancing algorithm. Second, it uses a ne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Permutation warping for data parallel volume rendering

    Publication Year: 1993, Page(s):57 - 60, 110
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    Volume rendering algorithms visualize sampled three dimensional data. A variety of applications create sampled data, including medical imaging, simulations, animation, and remote sensing. Researchers have sought to speed up volume rendering because of the high run time and wide application. Our algorithm uses permutation warping to achieve linear speedup on data parallel machines. This new algorit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A pyramid-based approach to interactive terrain visualization

    Publication Year: 1993, Page(s):67 - 70, 106
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    This paper describes a multiresolution approach to the visualization of surface data. The algorithms discussed allow the generation of arbitrary views of 3-dimensional surfaces. Image processing and texture mapping techniques are combined in a new 3-pass scanline algorithm to achieve smooth and continuous translations, rotations, and scale changes of large data sets. The implementation of the algo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel volume rendering and data coherence

    Publication Year: 1993, Page(s):23 - 26, 106
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    The two key issues in implementing a parallel ray-casting volume renderer are the work distribution and the data distribution. We have implemented such a renderer on the Fujitsu AP1000 using an adaptive image-space subdivision algorithm based on the worker-farm paradigm for the work distribution, and a distributed virtual memory, implemented in software, to provide the data distribution. Measureme... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable parallel volume raycasting for nonrectilinear computational grids

    Publication Year: 1993, Page(s):81 - 88, 111
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (896 KB)

    A scalable approach to parallel volume raycasting of structured and unstructured computational grids is presented. The algorithm is general enough to handle non-convex grids and cells, grids with voids, grids constructed from multiple grids, and embedded geometrical primitives. The algorithm is designed for a highly parallel MIMD architecture which features both local memory and shared memory with... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A MIMD rendering algorithm for distributed memory architectures

    Publication Year: 1993, Page(s):35 - 42, 108
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    We present a parallel rendering algorithm targeted to MIMD distributed-memory message-passing architectures. For maximum performance, the algorithm exploits both object-level and image level parallelism. The behavior of the algorithm is examined both analytically and experimentally. The results show that the choice of message size has a significant impact on performance. Scalability to large numbe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel volume-rendering algorithm performance on mesh-connected multicomputers

    Publication Year: 1993, Page(s):97 - 104
    Cited by:  Papers (18)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    This work examines the network performance of mesh-connected multicomputers applied to parallel volume rendering algorithms. This issue has not been addressed in papers describing particular parallel implementations, but is pertinent to anyone designing or implementing parallel rendering algorithms. Parallel volume rendering algorithms fall into two main classes-image and object partitions. Commun... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pixel merging for object-parallel rendering: A distributed snooping algorithm

    Publication Year: 1993, Page(s):49 - 56
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1008 KB)

    In the purely object-parallel approach to multiprocessor rendering, each processor is assigned responsibility to render a subset of the graphics database. When rendering is complete, pixels from the processors must be merged and globally z-buffered. On an arbitrary multiprocessor interconnection network, the straightforward algorithm for pixel merging requires d-A total network bandwidt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel approximate computation of projections for animated volume rendered displays

    Publication Year: 1993, Page(s):61 - 66
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    We present an approximate volume rendering algorithm that can compute multiple views of a 3D voxel-based data set concurrently. The approach employs a unique new method for combining partial results from neighboring objections to compute a sequence of rotated views, in fewer instructions than would be required for independent computations. For instance, the algorithm can compute a set of N project... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.