Isosurface generation by using extrema graphs
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A high-performance algorithm for generating isosurfaces is presented. In this algorithm, extrema points in a scalar field are first extracted. A graph is then generated in which the extrema points are taken as nodes. Each arc of the graph has a list of IDs of the cells that are intersected by the arc. A boundary cell list ordered according to cells' values is also generated. The graph and the list generated in this pre-process are used as a guide in searching for seed cells. Isosurfaces are generated from seed cells that are found in arcs of the graph. In this process, isosurfaces appear to propagate themselves. The algorithm visits only cells that are intersected by an isosurface and cells whose IDs an included in cell lists. It is especially efficient when many isosurfaces are interactively generated in a huge volume. Some benchmark tests described show the efficiency of the algorithm.Keywords
This publication has 5 references indexed in Scilit:
- Visualization of simulated airflow in a clean roomPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Span filtering: an optimization scheme for volume visualization of large finite element modelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Advanced interactive visualization for CFDComputing Systems in Engineering, 1990
- Volume probes: interactive data exploration on arbitrary gridsACM SIGGRAPH Computer Graphics, 1990
- Marching cubes: A high resolution 3D surface construction algorithmACM SIGGRAPH Computer Graphics, 1987