## Fast Isocontouring for Improved Interactivity (1996)

### Cached

### Download Links

- [www.ticam.utexas.edu]
- [www.ices.utexas.edu]
- [ftp.cs.purdue.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | In Proceedings of 1996 Symposium on Volume Visualization |

Citations: | 121 - 31 self |

### BibTeX

@INPROCEEDINGS{Bajaj96fastisocontouring,

author = {Chandrajit L. Bajaj and Valerio Pascucci and Daniel R. Schikore},

title = {Fast Isocontouring for Improved Interactivity},

booktitle = {In Proceedings of 1996 Symposium on Volume Visualization},

year = {1996},

pages = {39--46}

}

### OpenURL

### Abstract

We present an isocontouringalgorithm which is near-optimal for real-time interaction and modification of isovalues in large datasets. A preprocessing step selects a subset S of the cells which are considered as seed cells. Given a particular isovalue, all cells in S which intersect the given isocontour are extracted using a high-performance range search. Each connected component is swept out using a fast isocontour propagation algorithm. The computational complexity for the repeated action of seed point selection and isocontour propagation is O(logn 0 + k), where n 0 is the size of S and k is the size of the output. In the worst case, n 0 = O(n), where n is the number of cells, while in practical cases, n 0 is smaller than n by one to two orders of magnitude. The general case of seed set construction for a convex complex of cells is described, in addition to a specialized algorithm suitable for meshes of regular topology, including rectilinear and curvilinear meshes. Keyword...

### Citations

2074 | Marching cubes: A high resolution 3d surface construction algorithm
- Lorensen, Cline
- 1987
(Show Context)
Citation Context ... isocontours from scalar data has received a great deal of attention in recent years. Among the contributions to the field are methods for classifying and computing intersections within a single cell =-=[7, 11, 12, 17]-=-. Here we are concerned primarily with the search for intersected cells, 1 while the choice of triangulation technique can be chosen based on the data characteristics and topological needs of the appl... |

285 |
Computational Geometry. An Introduction Through Randomized Algorithms
- Mulmuley
- 1994
(Show Context)
Citation Context ...ed to the 1D line. That is, we assume as search space a set of 1D segments instead of a set of 2D points. In this way we can use well known search structures such as the segment tree (see e.g. [9] or =-=[10]-=-) or the interval tree, a specific case of a priority search tree [8]. Examples of each search tree are given in figure 5 for a small set of intervals and briefly discussed in the following paragraphs... |

276 | Octrees for faster isosurface generation
- Wilhelms, Gelder
- 1992
(Show Context)
Citation Context ...s do so by limiting the number of cells that are visited, thereby reducing the overhead associated with the inevitable search for cells which are intersected by the isocontour. Wilhelms and Van Gelder=-=[18]-=- use an efficient partial octree partitioning of a structured mesh with hierarchical [min; max] data in order to quickly locate cells which are intersected by the isocontour while skipping large regio... |

176 | A near optimal isosurface extraction algorithm using the span space
- Livnat, Shen, et al.
- 1996
(Show Context)
Citation Context ...above the isovalue. Optimizations are performed when the isovalue is changed by a small delta. Livnat, Shen, and Johnson describe a new approach which processes the cells into a 2D min-max span space =-=[6]-=-. Cells are preprocessed into a Kd-tree which allows O( p n + k) query time to determine the cells which intersect the contour, where k is the size of the output. It is reported that in the average ca... |

176 |
Priority Search Trees
- McCreight
- 1985
(Show Context)
Citation Context ...ents instead of a set of 2D points. In this way we can use well known search structures such as the segment tree (see e.g. [9] or [10]) or the interval tree, a specific case of a priority search tree =-=[8]-=-. Examples of each search tree are given in figure 5 for a small set of intervals and briefly discussed in the following paragraphs. In a segment tree, the set of min and max values of the segments ar... |

136 |
The asymptotic decider: resolving the ambiguity in marching cubes
- Nielson, Hamann
- 1991
(Show Context)
Citation Context ... isocontours from scalar data has received a great deal of attention in recent years. Among the contributions to the field are methods for classifying and computing intersections within a single cell =-=[7, 11, 12, 17]-=-. Here we are concerned primarily with the search for intersected cells, 1 while the choice of triangulation technique can be chosen based on the data characteristics and topological needs of the appl... |

127 |
Data Structures and Algorithms: 3. Multidimensional Searching and Computational Geometry
- Mehlhorn
- 1984
(Show Context)
Citation Context ...be mapped to the 1D line. That is, we assume as search space a set of 1D segments instead of a set of 2D points. In this way we can use well known search structures such as the segment tree (see e.g. =-=[9]-=- or [10]) or the interval tree, a specific case of a priority search tree [8]. Examples of each search tree are given in figure 5 for a small set of intervals and briefly discussed in the following pa... |

101 | Isosurfacing in span space with utmost efficiency (ISSUE
- Shen, Hansen, et al.
- 1996
(Show Context)
Citation Context ...ich demonstrates improved empirical results by using an L \Theta L lattice search decomposition in span space, in addition to allowing for parallel implementation on a distributed memory architecture =-=[13]-=-. A similar approach to ours has been developed independently by van Kreveld [16], in which seed sets are computed for the specialized case of a triangular mesh in two dimensions representing terrain ... |

71 |
Automatic isosurface propagation using an extrema graph and sorted boundary cell lists
- Itoh, Koyamada
- 1995
(Show Context)
Citation Context ... common and useful approaches is to compute and display isocontours C = fxjF(x) = wg. It is estimated that in a 3D domain D, the average number of cells intersected by an isocontour will be O(n 2=3 ) =-=[5]-=-, where n is the number of cells, which can 1 See also http://www.cs.purdue.edu/research/shastra 2 Department of Computer Sciences, Purdue University, West Lafayette, IN 47907-1398 USA. Email: fbajaj,... |

62 |
On generating topologically consistent isosurfaces from uniform samples
- Natarajan
- 1994
(Show Context)
Citation Context ... isocontours from scalar data has received a great deal of attention in recent years. Among the contributions to the field are methods for classifying and computing intersections within a single cell =-=[7, 11, 12, 17]-=-. Here we are concerned primarily with the search for intersected cells, 1 while the choice of triangulation technique can be chosen based on the data characteristics and topological needs of the appl... |

58 | The theory, design, implementation and evaluation of a three-dimensional surface detection algorithm - Artzy, Frieder, et al. - 1981 |

55 | ªSweeping Simplices: A Fast IsoSurface Extraction Algorithm for Unstructured Grids,º
- Shen, Johnson
- 1995
(Show Context)
Citation Context ... the performance of such a strategy. Shen and Johnson describe a Sweeping Simplices algorithm which maintains two lists of cells, one sorted by minimum cell value, the other by the maximum cell value =-=[14]-=-. For a given isovalue, a binary search in the minimum value list determines all cells with minimum value below the isovalue. Pointers from the minimum value list to the maximum value list are followe... |

47 |
Volume Probe: Interactive Data Exploration on Arbitrary Grids
- Speray, Kennon
- 1990
(Show Context)
Citation Context ... in the next section, followed by a simplified approach devised for regular grids. 3.1 Contour Propagation Extraction of 2D surfaces from 3D data by mesh propagation is described by Speray and Kennon =-=[15]-=- for the case of arbitrary slices in unstructured meshes, while others have applied similar techniques to isocontour extraction [1, 4, 5]. The central idea is that, given an initial cell which contain... |

39 |
Advanced Interactive Visualization for CFD
- Giles, Haimes
- 1990
(Show Context)
Citation Context ...with high spatial coherence but suffers when applied to noisy data. Recent techniques have concentrated on processing of the value space of the cells rather than the geometric space. Giles and Haimes =-=[3]-=- describe a method which forms two sorted lists of cells, one by minimum value and the other by maximum value. The maximum cell range, Dw, is computed, which allows the limitation of the search to cel... |

30 |
Topological considerations in isosurface generation – extended abstract
- Wilhelms, Gelder
- 1990
(Show Context)
Citation Context |

24 |
E.H.Blake, “The Mesh Propagation Algorithm for Isosurface Construction
- Howie
- 1994
(Show Context)
Citation Context ...e, cells for a given isovalue can be extracted in O(logn 0 + k) time. From each selected cell, one or more connected components of the isocontour are extracted by propagation through cell adjacencies =-=[4]-=-. 3 ALGORITHM OVERVIEW The approach we take is based on the formalization and unification of three known techniques. The three leading ideas we are retaining are the following: 2 1. The extraction of ... |

16 | Efficient Methods for Isoline Extraction from a Digital Elevation Model Based on Triangulated Irregular Networks
- Kreveld
- 1994
(Show Context)
Citation Context ... decomposition in span space, in addition to allowing for parallel implementation on a distributed memory architecture [13]. A similar approach to ours has been developed independently by van Kreveld =-=[16]-=-, in which seed sets are computed for the specialized case of a triangular mesh in two dimensions representing terrain for GIS applications. An interval tree is used to perform the search for intersec... |

8 |
Span filtering: An efficient scheme for volume visualization of large finite element models
- GALLAGHER
- 1991
(Show Context)
Citation Context ...approach is the fact that a single cell with a large Dw drastically reduces the effectiveness of the technique when specifying a random isovalue. Gallagher describes a technique called span filtering =-=[2]-=-, in which the entire range space is divided into a fixed number of buckets. Cells are grouped into buckets based on the minimum value taken on by the function over the cell. Within each bucket, cells... |

2 |
The theory, Data Resolution Seed cells % of total Distinct Seeds Tree Size Preprocessing Time (s) MRbrain 256x256x109 539832 7.69% 2802 3085225 116.41 CT Engine 256x256x110 131765 1.86% 256 333372 92.95 CT Cadaver 256x256x300 652531 3.36% 256 1965679 271.
- ARTZY, FRIEDER, et al.
- 1980
(Show Context)
Citation Context ... from 3D data by mesh propagation is described by Speray and Kennon [15] for the case of arbitrary slices in unstructured meshes, while others have applied similar techniques to isocontour extraction =-=[1, 4, 5]-=-. The central idea is that, given an initial cell which contains the surface of interest, the remainder of the surface can be efficiently traced performing a breadth-first search in the graph of cell ... |