Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
An implicit surface polygonizer
Graphics gems IV
The 3D marching lines algorithm
Graphical Models and Image Processing
The image processing handbook (3rd ed.)
The image processing handbook (3rd ed.)
Introduction to Computer Graphics
Introduction to Computer Graphics
Bezier and B-Spline Techniques
Bezier and B-Spline Techniques
Exploiting Triangulated Surface Extraction Using Tetrahedral Decomposition
IEEE Transactions on Visualization and Computer Graphics
Curves and Surfaces for Computer Graphics
Curves and Surfaces for Computer Graphics
A new computational framework for 2D shape-enclosing contours
Image and Vision Computing
Fundamentals of Computerized Tomography: Image Reconstruction from Projections
Fundamentals of Computerized Tomography: Image Reconstruction from Projections
| Hi-index | 0.00 |
In this paper we present a new method, which allows for the construction of triangular isosurfaces from three-dimensional data sets, such as 3D image data and/or numerical simulation data that are based on regularly shaped, cubic lattices. This novel volume-enclosing surface extraction technique, which has been named VESTA, can produce up to six different results due to the nature of the discretized 3D space under consideration. VESTA is neither template-based nor it is necessarily required to operate on 2x2x2 voxel cell neighborhoods only. The surface tiles are determined with a very fast and robust construction technique while potential ambiguities are detected and resolved. Here, we provide an in-depth comparison between VESTA and various versions of the well-known and very popular Marching Cubes algorithm for the very first time. In an application section, we demonstrate the extraction of VESTA isosurfaces for various data sets ranging from computer tomographic scan data to simulation data of relativistic hydrodynamic fireball expansions.