## Selectively Meshed Surface Representation (1995)

Venue: | Computer & Graphics |

Citations: | 2 - 0 self |

### BibTeX

@ARTICLE{Zhou95selectivelymeshed,

author = {Chen Zhou and Chen Zhou and Renben Shu and Renben Shu and Mohan S. Kankanhalli and Mohan S. Kankanhalli},

title = {Selectively Meshed Surface Representation},

journal = {Computer & Graphics},

year = {1995},

volume = {19}

}

### OpenURL

### Abstract

Surface rendering is an important technique for volume visualization. Any surface rendering algorithm has two phases - surface generation and rendering. We present a new surface rendering algorithm, which focuses on constructing the surface in a manner that speeds up the rendering phase. The motivation behind this is to reduce the response time for surface manipulations such as interactive rotations. We utilize a MC-like (Marching Cubes) approach to calculate the intersection points and their normals for each cube. But we dynamically link the intersection points to form triangles within the cube according to the locations of the last and the next visited neighboring cubes so that a good meshed surface can be generated. The difficulty with such an approach is that thousands of special cases need to be considered. But, we have found that the occurrence of 5 specific configurations out of the 14 basic MC cube configurations account for over 95% of all the cubes intersected by the iso-surface in most data sets. We process cubes belonging to these 5 configurations in a mesh mode, and the rest are processed in a non-mesh mode. As a result, the number of special cases are reduced substantially. Then a very careful analysis of the 5 configurations for mesh processing leads to just 136 cases, which makes the algorithm very simple. Test results show that the rendering time is almost halved compared to the time required for the rendering of a nonmeshed surface generated by MC.

### Citations

2162 | Marching cubes: A high resolution 3d surface construction algorithm
- Lorensen, Cline
- 1987
(Show Context)
Citation Context ... the surface [1, 4, 10, 11 and 12]. • The Dividing Cubes algorithm that generates a cloud of points [3]. • The Marching Cubes (MC) algorithm that creates a fine polygon (triangle) represented surf=-=ace [7]-=-. MC is the most popular surface generating algorithm since it is able to generate very high quality images by generating a set of triangles which closely approximates a surface of interest. There are... |

286 | Octrees for faster isosurface generation - Wilhelms, Gelder - 1992 |

72 |
Two algorithms for three dimensional reconstruction of tomographs
- Cline, Lorensen, et al.
- 1988
(Show Context)
Citation Context ...bes, that is why input and output edges can not be on plane XY). Because there are two faces on each of plane XZ or YZ, thus the number of choices to select both input and output edges is 12 (4 x 3). =-=(3) D-=-irection of input edge: Even for given input and output edges, the direction of input edge should be considered, which results in two possible sequences of vertices. In Figure 4a, let’s assume that ... |

65 |
Three-Dimensional Display of Human Organs from Computed Tomograms
- Herman
- 1979
(Show Context)
Citation Context ...ing conventional computer graphics techniques to render the surface (surface-rendering phase). The method of surface extraction is very important and several techniques have been developed to do this =-=[5]: ��-=-� A method using a cuberille model, in which the rectilinear faces of all nontransparent voxels are used to form a polygon (square) represented surface [2, 4]. • A surface tracking algorithm that cr... |

58 |
The theory, design, implementation and evaluation of a three-dimensional surface detection algorithm
- Artzy, Frieder, et al.
- 1981
(Show Context)
Citation Context ...as those shown in Figure 1 and Figure 2. They are usually like the one shown in Figure 3. Then a natural question is what constitutes a good mesh. We use the following criteria to define a good mesh: =-=(1)-=- A good mesh should consist of as many triangles as possible. This minimizes the number of vertices rendered more than once. (2) A good mesh should have the minimum number of swapping operations, if t... |

21 |
Surface shading in the cuberille environment
- Chen, Herman, et al.
- 1985
(Show Context)
Citation Context ...tutes a good mesh. We use the following criteria to define a good mesh: (1) A good mesh should consist of as many triangles as possible. This minimizes the number of vertices rendered more than once. =-=(2)-=- A good mesh should have the minimum number of swapping operations, if this is not at the expense of rule (1). 2.2 A Simple Meshed Surface Representation It is possible to post-process non-meshed surf... |

20 |
Fast surface tracking in three-dimensional binary images
- Gordon, Udupa
- 1989
(Show Context)
Citation Context ... techniques have been developed to do this [5]: • A method using a cuberille model, in which the rectilinear faces of all nontransparent voxels are used to form a polygon (square) represented surfac=-=e [2, 4]. -=-• A surface tracking algorithm that creates a surface from exterior voxel faces by starting from a seed on that surface and using a connectivity rule to form the rest of the surface [1, 4, 10, 11 an... |

20 |
The asymptotic decider: resolving the ambiguity
- Nielson, Hamann
- 1991
(Show Context)
Citation Context ...ta set belong to five basic configurations 1, 2, 5, 8 and 9 (See Table 1.). Frequency of configuration has also been studied for other purposes by Wilhelms and Van Gelder [13], and Nielson and Hamann =-=[8]-=-. The experimental results from 4 volume data sets by Wilhelms and Van Gelder show that the occurrence of the 5 configurations accounts for around 95%, whereas the results from 4 volume data sets by N... |

7 | Surface Versus Volume Rendering: A Comparative Assessment - Udupa, Hung - 1990 |

4 | Segmentation into three classes using gradients - Trivedi, Herman, et al. - 1986 |

2 | Chapter 1: Introduction to volume visualization. Volume Visualization - Kaufman - 1990 |

1 | Interactive volume visualization system for craniofacial surgery - Sobierajski, Kaufman, et al. - 1990 |