Craig M. Wittenbrink. Designing Optimal Parallel Volume Rendering Algorithms. PhD thesis, University of Washington, 1993.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....very efficiently. To virtualize we make an assignment of processors to the voxels. Object space voxel points are assigned to processor id s by an address tiling. Address tiling in three dimensions is an extension of two dimensional tiling techniques such as our cache tiling [14] Wittenbrink in [16] provides more detail on slice and dice virtualization. A slice, row major addressed volume coordinate is transformed to a sliced and diced coordinate by . Such virtualization is amenable to a wide variety of architectures such as mesh [1] hypercube, and multistage interconnection networks. Each ....

....shearing for the sphere. This results from the frequency content of the volumes. The cube is a step function and has infinite frequencies. The zero order hold maintains the resolution very well. The multipass approach has repeated aliasing steps which degrades the reconstruction. Wittenbrink in [16] provides more details. Fig. 4, Fig. 5, and Fig. 6 show MR angiography rendering to illustrate filter differences. Fig. 4 shows the noise inherent in the MR angiography data. Fig. 5 shows the 256x256x32 data rendered at 512x512 zooming in on the bifurcation of Fig. 4. Fast traversal is possible ....

Wittenbrink, Craig M. Designing Optimal Parallel Volume Rendering Algorithms. Ph.D. dissertation, University of Washington, 1993.

.... 113] 44] 52] 107] 111, 81] 94] 16, 15] 34] 101] 40] 66] 73] 90] 116] 26] 20] 68] 6] 54, 52, 63, 28, 67] 7, 1, 42, 4, 62] 31, 75, 30, 38, 86] 41, 21, 119, 112, 118, 45, 58] 55, 65, 14, 29, 79] 115, 53, 70, 74, 87, 19, 117, 32] 72, 57, 92, 36, 7] 111, 12, 90, 97, 78, 5] [15, 27, 35, 43, 87, 28, 51, 22, 23, 59, 60, 64, 63, 66, 68, 71, 80, 81, 91, 93, 99, 47, 108] [103, 116, 83, 106, 107, 105, 2, 76, 110, 77] 11, 104, 101, 96, 89, 26, 73, 6, 17, 52, 54, 85, 114, 9, 82, 37, 24] 8, 61, 3, 56, 67, 88, 44, 10, 69, 48, 16, 84, 113, 95, 13, 50, 94, 40, 46] 100, 109, 102] 25, 18, 33, 39] ....

Craig M. Wittenbrink. Designing Optimal Parallel Volume Rendering Algorithms. PhD thesis, University of Washington, 1993.

No context found.

Craig M. Wittenbrink. Designing Optimal Parallel Volume Rendering Algorithms. PhD thesis, University of Washington, 1993.

.... The CS evaluates the view ray line integrals to get the two dimensional screen space pixel intensities, The final output is a two dimensional array of pixel values, For a more in depth discussion of volume rendering see Blinn [3] Kajiya and von Herzen [14] Levoy [18] 19] and our survey [36]. Transparency Volume Render( Step 1 Step 2 Step 3 FIGURE 2 Data Parallel Volume Rendering Algorithm FIGURE 16 and FIGURE 17 show an example volume rendering of magnetic resonance angiography images from data collected from a time of flight process that images human s blood flowing ....

....multiplications and ( additions to take , and to when is a power of two. The most efficient sequential method, ignoring data dependent optimizations is back to front where no incremental transparency or opacity updates are performed giving ( multiplications and ( additions. See our work in [36] for details. Similar results for the associativity, as well as the logarithmic combine time of the ray compositing, Theorem 2, can be found throughout the literature [28] 12] 8] 9] and we do not claim novelty, but we include it here for completeness. Theorem 3 results from Theorem 1, Theorem ....

[Article contains additional citation context not shown here]

Wittenbrink, C. M. Designing Optimal Parallel Volume Rendering Algorithms. Ph.D. dissertation, University of Washington, 1993.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC