Results 1  10
of
52,257
Parallel Volume Rendering Using BinarySwap Image Composition
 IEEE Computer Graphics and Applications
, 1994
"... This paper presents a divideandconquer raytraced volume rendering algorithm and a parallel image compositing method, along with their implementation and performance on the Connection Machine CM5, and networked workstations. This algorithm distributes both the data and the computations to individ ..."
Abstract

Cited by 147 (34 self)
 Add to MetaCart
during this local raytracing process. A subimage is generated by each processing unit and the final image is obtained by compositing subimages in the proper order, which can be determined a priori. Composition is done in parallel via a new algorithm we call BinarySwap compositing. Test results on both
BinarySwap Volumetric Rendering on the T3D
 In Cray Users Group Conference
, 1995
"... This paper presents a data distributed parallel raytraced volume rendering algorithm and its implementation on the CRI T3D. This algorithm distributes the data and the computational load to individual processing units to achieve fast and highquality rendering of highresolution data. The volume dat ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
by compositing subimages in the proper order by the BinarySwap algorithm. Performance of this algorithm on the T3D is presented and compared to an implementation on the CM5. 1 Introduction The visualization of 3D scalar data sets has proven an enormous boon for scientists. 3D scalar data sets arise not only
Implementation and Evaluation of Binary Swap Volume Rendering on a Commodity–Based Visualization Cluster
"... This paper describes the implementation and performance evaluation of a parallel volume renderer capable of handling large volumetric data sets. We implement our volume renderer on a cluster of 32 Linux PC’s using OpenGL, MPI and a binary–swap compositing algorithm. We also give hints for achieving ..."
Abstract
 Add to MetaCart
This paper describes the implementation and performance evaluation of a parallel volume renderer capable of handling large volumetric data sets. We implement our volume renderer on a cluster of 32 Linux PC’s using OpenGL, MPI and a binary–swap compositing algorithm. We also give hints for achieving
Abstract An Improved BinarySwap Compositing for SortLast Parallel Rendering on Distributed Memory Multiprocessors ⋆
"... Sortlast parallel rendering is a good rendering scheme on distributed memory multiprocessors. This paper presents an improvement on the binaryswap (BS) method, which is an efficient image compositing algorithm for sortlast parallel rendering. Our compositing method uses three acceleration techniq ..."
Abstract
 Add to MetaCart
Sortlast parallel rendering is a good rendering scheme on distributed memory multiprocessors. This paper presents an improvement on the binaryswap (BS) method, which is an efficient image compositing algorithm for sortlast parallel rendering. Our compositing method uses three acceleration
Massively parallel volume rendering using 23 swap image compositing
 In Proceedings of the 2008 ACM/IEEE Conference on Supercomputing
, 2008
"... The everincreasing amounts of simulation data produced by scientists demand highend parallel visualization capability. However, image compositing, which requires interprocessor communication, is often the bottleneck stage for parallel rendering of large volume data sets. Existing image compositing ..."
Abstract

Cited by 22 (4 self)
 Add to MetaCart
compositing solutions either incur a large number of messages exchanged among processors (such as the direct send method), or limit the number of processors that can be effectively utilized (such as the binary swap method). We introduce a new image compositing algorithm, called 23 swap, which combines
Swap Logic
"... Abstract. We investigate dynamic modal operators that can change the model during evaluation. We define the logic SL by extending the basic modal language with the ♦ modality, which is a diamond operator that in addition has the ability to invert pairs of related elements in the domain while traver ..."
Abstract
 Add to MetaCart
Abstract. We investigate dynamic modal operators that can change the model during evaluation. We define the logic SL by extending the basic modal language with the ♦ modality, which is a diamond operator that in addition has the ability to invert pairs of related elements in the domain while traversing an edge of the accessibility relation. SL is very expressive: it fails to have the finite and the tree model property. We show that SL is equivalent to a fragment of firstorder logic by providing a satisfiability preserving translation. In addition, we provide an equivalence preserving translation from SL to the hybrid logicH(:, ↓). We also define a suitable notion of bisimulation for SL and investigate its expressive power, showing that it lies strictly between the basic modal logic and H(:, ↓). We finally show that its model checking problem is PSpacecomplete and its satisfiability problem is undecidable.
Direct Binary Search with Adaptive Search and Swap
, 2005
"... Grayscale halftoning is the technique of approximating a grayscale image by a blackandwhite image. Blackandwhite printers use halftoning to replicate grayscale images on paper. The printers have only the black of ink and the white of paper as the colors at their disposal. Although the printers m ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Grayscale halftoning is the technique of approximating a grayscale image by a blackandwhite image. Blackandwhite printers use halftoning to replicate grayscale images on paper. The printers have only the black of ink and the white of paper as the colors at their disposal. Although the printers may vary the size of dots they drop, they cannot vary the intensity of the droplets. All droplets are black. The printers therefore actually produce blackandwhite halftones instead of grayscale prints. The task is to make the blackandwhite image indistinguishable from the grayscale one. We consider a halftoned image to be a good approximation to the original grayscale in the obvious sense: perceptually, the images look like one another. How to quantify this metric, however, is less than obvious. A complete model for the human visual system is an open research problem and must take many things into account: for example, how the eye blurs together nearby pixels, the sensitivity of the eye to changes in texture and luminescence, the attenuated response of the eye to changes along diagonal directions, and how optical illusions fool the brain. Understanding that the approximation problem must take into account visual perception, we define the grayscale halftoning problem: The Halftoning Problem Given a grayscale image I, find a black and white image O that minimizes �G(O) − G(I)�2, where G(·) is the image perceived when viewing ·.
The Value of the “Swap ” Feature in Equity Default Swaps ∗
"... When equity default swap (EDS) contracts were first included in a rated collateralized debt obligation (CDO) deal, some critics doubted the originality of the product. In fact, EDSs are equivalent to already existing binary barrier options on equity, except the premium is not paid upfront, but over ..."
Abstract
 Add to MetaCart
When equity default swap (EDS) contracts were first included in a rated collateralized debt obligation (CDO) deal, some critics doubted the originality of the product. In fact, EDSs are equivalent to already existing binary barrier options on equity, except the premium is not paid upfront, but over
Results 1  10
of
52,257