The Mesh Propagation Algorithm for Isosurface Construction

Loading...
Thumbnail Image
Date
1994
Journal Title
Journal ISSN
Volume Title
Publisher
Blackwell Science Ltd and the Eurographics Association
Abstract
A new algorithm, Mesh Propagation, is presented for the generation of isosurfaces from three-dimensional discrete data sets. While producing the same surface mesh as that generated by a corrected Marching Cubes algorithm, its characteristic is that it constructs an isosurface using connected strips of dynamically triangulated polygons. This compact data structure speeds up surface construction and reduces surface storage requirements. The surface can also be displayed more quickly, particularly where there is hardware support for rendering triangle strips.With engineering as well as medical imaging applications in mind, the algorithm can be used with both irregular and rectilinear grids of data, the primitive volume elements need not be hexahedral only, and volumes of heterogeneous polyhedral elements are supported without traversal complications.The algorithm propagates through the cells in the grid and uses the same lookup table topologies as Marching Cubes to determine patches of surface-element intersection- additional tables are used for non-hexahedral elements. The surface patches are dynamically coded into triangle strips which are then concatenated and linked to construct the surface. The data structures used for propagating through the volume overcome the topological ambiguities associated with table-based methods of surface construction and no holes are generated in the final mesh.
Description

        
@article{
10.1111:1467-8659.1330065
, journal = {Computer Graphics Forum}, title = {{
The Mesh Propagation Algorithm for Isosurface Construction
}}, author = {
Howic, C.T.
and
Blake, E.H.
}, year = {
1994
}, publisher = {
Blackwell Science Ltd and the Eurographics Association
}, ISSN = {
1467-8659
}, DOI = {
10.1111/1467-8659.1330065
} }
Citation