Interactive ray tracing for isosurface rendering

Parker,; Shirley,; Livnat,; Hansen, Ole; Sloan,

doi:10.1109/visual.1998.745713

Cited by 169 publications

(142 citation statements)

References 11 publications

Supporting

Mentioning

142

Contrasting

Order By: Relevance

“…Interactive isosurfacing of large volumes was first realized in a ray tracer by Parker et al [14], using a hierarchical grid of macrocells as an acceleration structure. A single ray was tested for intersection inside a cell of eight voxel vertices, solving a cubic polynomial to find where the ray intersects the interpolant surface in that local cell.…”

Section: Ray Tracing Volumesmentioning

confidence: 99%

Coherent multiresolution isosurface ray tracing

2008

View full text Add to dashboard Cite

Abstract-We implement and evaluate a fast ray tracing method for rendering large structured volumes. Input data is compressed into an octree, enabling residency in CPU main memory. We cast packets of coherent rays through a min/max acceleration structure within the octree, employing a slicebased technique to amortize the higher cost of compressed data access. By employing a multiresolution level of detail scheme in conjunction with packets, coherent ray tracing can efficiently render inherently incoherent scenes of complex data. We achieve higher performance with lesser footprint than previous isosurface ray tracers, and deliver large frame buffers, smooth gradient normals and shadows at relatively lesser cost. In this context, we weigh the strengths of coherent ray tracing against those of the conventional single-ray approach.

show abstract

Section: Ray Tracing Volumesmentioning

confidence: 99%

Coherent multiresolution isosurface ray tracing

2008

View full text Add to dashboard Cite

show abstract

“…This is because the number of triangles computed from the marching cubes algorithm [14] is often quite large. To reduce the size of the geometry, researchers have proposed various approaches such as surface decimation [20] and view-dependent methods [13,18]. In general, surface decimation is mostly performed at a post-processing step and thus is not suitable for dynamic isosurface exploration.…”

Section: Surfacesmentioning

confidence: 99%

Interactive Exploration of Remote Isosurfaces with Point-Based Non-Photorealistic Rendering

Ji¹,

Shen

Gao

2008

2008 IEEE Pacific Visualization Symposium

View full text Add to dashboard Cite

We present a non-photorealistic rendering technique for interactive exploration of isosurfaces generated from remote volumetric data. Instead of relying on the conventional smooth shading technique to render the isosurfaces, a point-based technique is used to represent and render the isosurfaces in a remote client-server environment. The non-photorealistic nature of the proposed rendering method enables the server to transmit only the essential surface features, which substantially reduces the network traffic. The algorithm also utilizes frame coherence and efficiently encodes the isosurface configuration inside each voxel cell to further minimize the network overhead. Finally, our algorithm can adjust the point distributions using different illumination settings to adapt to different network speeds.

show abstract

“…Ray-tracing, nevertheless, does not take advantage of graphics hardware and requires a large number of CPUs to achieve interactivity [9].…”

Section: Image Space Decompositionmentioning

confidence: 99%

“…To address these issues, we have implemented a shallow hierarchy [9]. Each level of the hierarchy can have a different number of nodes.…”

Section: The Min/max Treementioning

confidence: 99%

Accelerated Isosurface Extraction Approaches

Livnat

2005

Visualization Handbook

View full text Add to dashboard Cite

The marching cubes [7,15] method demonstrated that isosurface extraction can be reduced, using a divide-and-conquer approach, to solving a local triangulation problem. In addition, the marching cubes method proposed a simple and efficient local triangulation using a lookup table. However, the marching cubes did not address the divide portion of the approach, i.e., how to efficiently search a large dataset for these small local triangulations. To this end, the marching cubes method checks each and every cell of the dataset.In this chapter, we introduce the three main approaches to accelerate isosurface extraction, (Section 2.2) and present two specific methods. Section 2.3 introduces the Span Space metaphor and uses it to devise a near-optimal search method in Section 2.4. Finally, Section 2.5 examines the view-dependent extraction approach and presents a particular implementation.

show abstract

Interactive ray tracing for isosurface rendering

Cited by 169 publications

References 11 publications

Coherent multiresolution isosurface ray tracing

Coherent multiresolution isosurface ray tracing

Interactive Exploration of Remote Isosurfaces with Point-Based Non-Photorealistic Rendering

Accelerated Isosurface Extraction Approaches

Contact Info

Product

Resources

About