Shrouds: Optimal Separating Surfaces for Enumerated Volumes
| dc.contributor.author | Nielson, Gregory M. | en_US |
| dc.contributor.author | Graf, Gary | en_US |
| dc.contributor.author | Holmes, Ryan | en_US |
| dc.contributor.author | Huang, Adam | en_US |
| dc.contributor.author | Phielipp, Mariano | en_US |
| dc.contributor.editor | G.-P. Bonneau and S. Hahmann and C. D. Hansen | en_US |
| dc.date.accessioned | 2014-01-30T07:36:32Z | |
| dc.date.available | 2014-01-30T07:36:32Z | |
| dc.date.issued | 2003 | en_US |
| dc.description.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. | en_US |
| dc.description.seriesinformation | Eurographics / IEEE VGTC Symposium on Visualization | en_US |
| dc.identifier.isbn | 3-905673-01-0 | en_US |
| dc.identifier.issn | 1727-5296 | en_US |
| dc.identifier.uri | https://doi.org/10.2312/VisSym/VisSym03/075-084 | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.title | Shrouds: Optimal Separating Surfaces for Enumerated Volumes | en_US |
Files
Original bundle
1 - 1 of 1