Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Shape reconstruction from planar cross sections
Computer Vision, Graphics, and Image Processing
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Separation and approximation of polyhedral objects
Computational Geometry: Theory and Applications
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Computing the separating surface for segmented data
VIS '97 Proceedings of the 8th conference on Visualization '97
Interactive multi-resolution modeling on arbitrary meshes
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Reducing aliasing artifacts in iso-surfaces of binary volumes
VVS '00 Proceedings of the 2000 IEEE symposium on Volume visualization
Optimal surface reconstruction from planar contours
Communications of the ACM
Scanline surfacing: building separating surfaces from planar contours
Proceedings of the conference on Visualization '00
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Permission grids: practical, error-bounded simplification
ACM Transactions on Graphics (TOG)
Feature-preserving volume filtering
VISSYM '02 Proceedings of the symposium on Data Visualisation 2002
Locally Toleranced Surface Simplification
IEEE Transactions on Visualization and Computer Graphics
A Developer's Survey of Polygonal Simplification Algorithms
IEEE Computer Graphics and Applications
Superfaces: Polygonal Mesh Simplification with Bounded Error
IEEE Computer Graphics and Applications
Shrouds: optimal separating surfaces for enumerated volumes
VISSYM '03 Proceedings of the symposium on Data visualisation 2003
Non-manifold mesh extraction from time-varying segmented volumes used for modeling a human heart
EUROVIS'05 Proceedings of the Seventh Joint Eurographics / IEEE VGTC conference on Visualization
Discrete multi-material interface reconstruction for volume fraction data
EuroVis'08 Proceedings of the 10th Joint Eurographics / IEEE - VGTC conference on Visualization
Dynamic grid for mesh generation by the advancing front method
Computers and Structures
| Hi-index | 0.00 |
We present a method for extracting boundary surfaces from segmented cross-section image data. We use a constrained Potts model to interpolate an arbitrary number of region boundaries between segmented images. This produces a segmented volume from which we extract a triangulated boundary surface using well-known marching tetrahedra methods. This surface contains staircase-like artifacts and an abundance of unnecessary triangles. We describe an approach that addresses these problems with a voxel-accurate simplification algorithm that reduces surface complexity by an order of magnitude. Our boundary interpolation and simplification methods are novel contributions to the study of surface extraction from segmented cross-sections. We have applied our method to construct polycrystal grain boundary surfaces from micrographs of a sample of the metal tantalum.