Three dimensional visualization of proteins in cellular interactions

Monks, Thomas; Crossno,; Davidson,; Pavlakos,; Kupfer,; Silva, S. Ravi P.; Wylie,

doi:10.1109/visual.1996.568133

Cited by 7 publications

(4 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Visualization of single-section three-dimensional confocal data has been done both in Virtual Reality environments and on desktop computers [1][2][3] utilizing essentially the same techniques used in medical image (CT, MRI) visualization.…”

Section: Introductionmentioning

confidence: 99%

Reconstruction and exploration of three-dimensional confocal microscopy data in an immersive virtual environment

Xue

Rasmussen

et al. 2005

Computerized Medical Imaging and Graphics

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

Reconstruction and exploration of three-dimensional confocal microscopy data in an immersive virtual environment

Xue

Rasmussen

et al. 2005

Computerized Medical Imaging and Graphics

View full text Add to dashboard Cite

“…These contours isolate surfaces of interest, focusing attention on important features in the data, such as material boundaries and shock waves, while suppressing extraneous information. Several disciplines, including medicine [1], [2], computational fluid dynamics (CFD) [3], [4], and molecular dynamics [5], [6], have used this method effectively.…”

Section: Introductionmentioning

confidence: 99%

Accelerated isosurface extraction in time-varying fields

Sutton

Hansen

2000

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

ÐFor large time-varying data sets, memory and disk limitations can lower the performace of visualization applications. Algorithms and data structures must be explicitly designed to handle these data sets in order to achieve more interactive rates. The Temporal Branch-on-Need Octree (T-BON) extends the three-dimensional branch-on-need octree for time-varying isosurface extraction. This data structure minimizes the impact of the I/O bottleneck by reading from disk only those portions of the search structure and data necessary to construct the current isosurface. By performing a minimum of I/O and exploiting the hierarchical memory found in modern CPUs, the T-BON algorithm achieves high performance isosurface extraction in time-varying fields. This paper extends earlier work on the T-BON data structure by including techniques for better memory utilization, out-of-core isosurface extraction, and support for nonrectilinear grids. Results from testing the T-BON algorithm on large data sets show that its performance is similar to that of the three-dimensional branch-on-need octree for static data sets while providing substantial advantages for timevarying fields. Index TermsÐIsosurface, time-dependent scalar field visualization, multiresolution methods, octree, bricking, unstructured grid visualization, out-of-core visualization. ae 1. Our test data sets range in size from 8.4MB to 537MB per time step.

show abstract

“…Several multiprocessor applications have been developed in the last few years to solve a large spectrum of problems such as scientific visualization [4,5], rendering [6,7,8], and many other topics; an introduction to parallel rendering can be found in [9].…”

Section: Introductionmentioning

confidence: 99%

A Flexible Algorithm for Multiprocessor Ray Tracing

Sanna

Montuschi

Rossi

1998

The Computer Journal

View full text Add to dashboard Cite

Ray tracing programs are widely used to generate photo-realistic images, but the high computation time may discourage their implementation on single-processor machines; moreover, cost reduction of multi-processor general purpose architectures makes parallel rendering an attractive field of research. We propose a new algorithm which addresses the main issues of a parallel implementation of ray tracing on a message-passing-based machine. We adopt efficient strategies for dynamic workload distribution among processors, task synchronization and communication delay reduction. The resulting implementation is highly flexible, since any number of processors can be employed without introducing synchronization problems. We show an implementation of our algorithm on an nCUBE 2 supercomputer which is a general purpose parallel architecture with distributed memory. A theoretical evaluation of our algorithm allows us to identify a decreasing function for rendering times; the considered examples confirm the theoretical expectations showing that the efficiency of our system may reach up to the 91% of the value achievable by dividing the sequential rendering time by the number of processors employed.

show abstract

Three dimensional visualization of proteins in cellular interactions

Cited by 7 publications

References 7 publications

Reconstruction and exploration of three-dimensional confocal microscopy data in an immersive virtual environment

Reconstruction and exploration of three-dimensional confocal microscopy data in an immersive virtual environment

Accelerated isosurface extraction in time-varying fields

A Flexible Algorithm for Multiprocessor Ray Tracing

Contact Info

Product

Resources

About