Time-critical rendering of irregular grids

Farias, Ricardo; Mitchell, Joseph S. B.; Silva, C.T.; Wylie, Brian N.

doi:10.1109/sibgra.2000.883919

Cited by 8 publications

(4 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The actual ray casting is performed independently for each pixel by performing a walk in the cell complex that is stored as an ordered list of stabbing boundary faces computed for each pixel. Farias et al [12,13] propose a time critical rendering system for unstructured grids. They use the ray-casting algorithm presented in [9] with some improvements and the algorithms for volume data simplification are also augmented to create hierarchical multiresolution representations.…”

Section: Image-space Methodsmentioning

confidence: 99%

Direct volume rendering of unstructured grids

Berk

Aykanat

Güdükbay

2003

Computers & Graphics

View full text Add to dashboard Cite

This paper investigates three categories of algorithms for direct volume rendering of unstructured grids, which are image-space, object-space, and hybrid methods. We propose three new algorithms. Cell Projection algorithm, which falls into object-space category, is capable of rendering non-convex meshes through a simple yet efficient sorting schema that exploits both image and object space coherencies. Existing hybrid methods use object-then-image traversal order that enforces the processing of each cell. Thus, these algorithms perform redundant operations and do not support early ray termination. We propose a hybrid method, called Span-Buffer Ray Casting (SBRC), that can support early ray termination discarding redundant operations by employing image-then-object traversal order. Another hybrid method, called Koyamada-SBRC (K-SBRC), is proposed with the motivation of refining image-space and hybrid methods to extract the best features of them. This method is developed by blending SBRC approach with Koyamada's algorithm, which is an efficient image-space algorithm. All proposed algorithms are capable of handling acyclic non-convex meshes and generating images of acceptable quality. SBRC and K-SBRC algorithms have the additional capabilities of rendering cyclic meshes and supporting early ray termination. The proposed algorithms and Koyamada's algorithm are implemented and experimented in a common framework for analyzing their relative performance. © 2003 Elsevier Science Ltd. All rights reserved

show abstract

Section: Image-space Methodsmentioning

confidence: 99%

Direct volume rendering of unstructured grids

Berk

Aykanat

Güdükbay

2003

Computers & Graphics

View full text Add to dashboard Cite

show abstract

“…Farias et al [FMSW00] present an algorithm to improve the speed of volume rendering for unstructured grids using an approach similar to the one proposed in this paper. This technique uses the following steps.…”

Section: Other Tetrahedra Mesh Simplification Techniquesmentioning

confidence: 99%

“…Our new algorithm builds on our previous work [FMSW00]. Although based on related ideas, our previous method was quite rudimentary, and was meant to be used primarily for low-quality renderings.…”

Section: Introductionmentioning

confidence: 99%

Simplification of unstructured tetrahedral meshes by point sampling

Uesu¹,

Bavoil²,

Fleishman³

et al. 2005

Fourth International Workshop on Volume Graphics, 2005.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Because the size of the unstructured grids continues to increase faster than our visualization techniques can handle them, other research has focused on approximately rendering unstructured grids to maintain interactivity [4,13,20,28]. The two main techniques have been to use LOD representations of the data [2,3,16,33], or to sparsely sample viewing rays.…”

Section: Related Workmentioning

confidence: 99%

Interactive Rendering of Large Unstructured Grids Using Dynamic Level-of-Detail

Callahan¹,

Comba²,

Shirley³

et al.

VIS 05. IEEE Visualization, 2005.

Self Cite

View full text Add to dashboard Cite

Figure 1: Volume renderings of the Torso data set with over one million tetrahedra using view-aligned sampling. From left to right: full quality (100% LOD) rendering at 2.0 fps, 25% LOD at 5.3 fps, 10% LOD at 10.0 fps, and 5% LOD at 16.1 fps. ABSTRACTWe describe a new dynamic level-of-detail (LOD) technique that allows real-time rendering of large tetrahedral meshes. Unlike approaches that require hierarchies of tetrahedra, our approach uses a subset of the faces that compose the mesh. No connectivity is used for these faces so our technique eliminates the need for topological information and hierarchical data structures. By operating on a simple set of triangular faces, our algorithm allows a robust and straightforward graphics hardware (GPU) implementation. Because the subset of faces processed can be constrained to arbitrary size, interactive rendering is possible for a wide range of data sets and hardware configurations.

show abstract

Time-critical rendering of irregular grids

Cited by 8 publications

References 14 publications

Direct volume rendering of unstructured grids

Direct volume rendering of unstructured grids

Simplification of unstructured tetrahedral meshes by point sampling

Interactive Rendering of Large Unstructured Grids Using Dynamic Level-of-Detail

Contact Info

Product

Resources

About