Octrees for faster isosurface generation

Wilhelms, Jane; Gelder, Allen Van

doi:10.1145/99307.99321

Cited by 101 publications

(87 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Storing values at cell corners has been used for implicit representation of shapes using distance fields [12,14,33,34], medical volume image segmentation [2], or in numerical PDE solvers [13,16,20]. In these works, samples stored at the cell centers are not interpolated.…”

Section: Previous Workmentioning

confidence: 99%

Interpolation and parallel adjustment of center-sampled trees with new balancing constraints

et al. 2014

View full text Add to dashboard Cite

We present a novel tree balancing constraint that is slightly stronger than the well-known 2-to-1 balancing constraint used in octree data structures (Tu and O'hallaron, Balanced refinement of massive linear octrees. Tech. Rep. CMU-CS-04-129. Carnegie Mellon School of Computer Science, Pennsylvania, 2004). The new balancing produces a limited number of local cell connectivity types (stencils): 5 for a quadtree and 21 for an octree. Using this constraint, we interpolate the data sampled at cell centers using weights pre-computed by interpolation or by generating interpolation codes for each stencil. In addition, we develop a parallel tree adjustment algorithm, and show that the imposed balancing constraint is satisfied even when the tree is adjusted in parallel. We also show that the adjustment has high parallelization performance. We finally apply the new balancing scheme to level set image segmentation and smoke simulation problems. Electronic supplementary materialThe online version of this article (

show abstract

Section: Previous Workmentioning

confidence: 99%

Interpolation and parallel adjustment of center-sampled trees with new balancing constraints

et al. 2014

View full text Add to dashboard Cite

show abstract

“…The span space is the value space composed of the maximum and minimum values in a cell. Other approaches related to the former process include a method for octree-based volume decomposition (Wilhelms and Van Gelder, 1992) and a technique that utilizes a topological structure generated from the local maxima and minima of a scalar field (Kreveld et al, 1997;Itoh et al, 2001).…”

Section: Regular Papermentioning

confidence: 99%

Numerical visualization by rapid isosurface extractions using 3D span spaces

Hirano

Itoh

Shirayama

2008

J Vis

View full text Add to dashboard Cite

In this paper, we focus on visualization of a 3D scalar field composed of volume data by means of semi-transparent multiple isosurface extraction. A new method for displaying semi-transparent multiple isosurfaces will be proposed to fulfill real-time rendering of scalar fields. The proposed method is considered to be an extension of ISSUE, which is a known algorithm to quickly generate isosurfaces. ISSUE uses a 2D span space, where minimum values of computational cells are assigned to the horizontal axis, and maximum values of cells are assigned to the vertical axis. In the proposed algorithm, computational cells are placed onto a 3D span space. The third axis is the distance from the viewpoint. The proposed algorithm can quickly search for the cells intersecting with isosurfaces using the span space in back-to-front order and can realize representation of semi-transparent multiple isosurfaces.

show abstract

“…When designing a volume rendering method, we considered the possibility of high parallel performance for very complicated grids and extremely large data sets. The proposed implementation includes partitioning complicated grids by supervoxels, building Branch-on-need Octree (BONO) (WILHELMS and GELDER, 1992) in each supervoxel, rendering on each SMP node, and finally compositing among SMP nodes.…”

Section: Suitable Design For Pvr Algorithmmentioning

confidence: 99%

Parallel Visualization of Large-scale Unstructured Geophysical Data for the Earth Simulator

Chen

Fujishiro

Nakajima

2004

Pure appl. geophys.

View full text Add to dashboard Cite

A scalable and high-performance parallel visualization subsystem has been developed in GeoFEM for the Earth Simulator. As part of the Earth Simulator project in Japan, the proposed subsystem is effective for the visualization of large-scale geoscientific data, and can be concurrent with computation subsystems on the same high-performance parallel computer. Moreover, several parallel visualization methods are developed for large unstructured datasets, covering scalar, vector and tensor fields. Furthermore, a number of strategies are adopted in order to improve the parallel performance of the proposed subsystem for the Earth simulator, including the three-level hybrid parallelization and dynamic load balancing. Good visualization images and high parallel performance have been obtained on a Hitachi SR8000 for large unstructured geoscientific data sets, and thus demonstrating the feasibility and effectiveness of the proposed method for use on the Earth Simulator.

show abstract

Octrees for faster isosurface generation

Cited by 101 publications

References 11 publications

Interpolation and parallel adjustment of center-sampled trees with new balancing constraints

Interpolation and parallel adjustment of center-sampled trees with new balancing constraints

Numerical visualization by rapid isosurface extractions using 3D span spaces

Parallel Visualization of Large-scale Unstructured Geophysical Data for the Earth Simulator

Contact Info

Product

Resources

About