Shrouds: Optimal Separating Surfaces for Enumerated Volumes

Nielson, Gregory M.; Graf, Gary; Holmes, Ryan; Huang, Adam; Phielipp, Mariano

Shrouds: Optimal Separating Surfaces for Enumerated Volumes

Files

075-084.pdf (1.51 MB)

Date

2003

Authors

Nielson, Gregory M.
Graf, Gary
Holmes, Ryan
Huang, Adam
Phielipp, Mariano

Publisher

The Eurographics Association

Abstract

We describe new techniques for computing a smooth triangular mesh surface that surrounds an enumerated volume consisting of a collection of points from a 3D rectilinear grid. The surface has the topology of an isosurface computed by a marching cubes method applied to a field function that has the value one at the points in the volume and zero for points not in the volume. The vertices are confined to the edges of the grid that penetrate this separating surface and the precise positions are computed so as to optimize a certain energy functional applied to the surface. We use efficient iterative methods to compute the optimal separating surfaces. We lift the concept of energy functionals for planar curves to isosurfaces by means of the 4*-network which is a unique collection of orthogonal planar polygons lying on the isosurface. The general strategy that we describe here leads to methods that are simple, efficient, and effective.

        @inproceedings{:10.2312/VisSym/VisSym03/075-084
,
booktitle = {Eurographics / IEEE VGTC Symposium on Visualization
},
editor = {G.-P. Bonneau and S. Hahmann and C. D. Hansen
},
title = {{Shrouds: Optimal Separating Surfaces for Enumerated Volumes
}},
author = {Nielson, Gregory M. and 
Graf, Gary and 
Holmes, Ryan and 
Huang, Adam and 
Phielipp, Mariano
},
year = {2003
},
publisher = {The Eurographics Association
},
ISSN = {1727-5296
},
ISBN = {3-905673-01-0
},
DOI = {/10.2312/VisSym/VisSym03/075-084
}
}