Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Shape transformation for polyhedral objects
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Linear complexity hexahedral mesh generation
Proceedings of the twelfth annual symposium on Computational geometry
Quality Mesh Generation in Higher Dimensions
SIAM Journal on Computing
Feature sensitive surface extraction from volume data
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Improving the Robustness and Accuracy of the Marching Cubes Algorithm for Isosurfacing
IEEE Transactions on Visualization and Computer Graphics
Distance Field Manipulation of Surface Models
IEEE Computer Graphics and Applications
Robustness Issues in Geometric Algorithms
FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Provably good surface sampling and approximation
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Sampling and meshing a surface with guaranteed topology and geometry
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
| Hi-index | 0.00 |
We present a subdivision based algorithm for multi-resolution Hexahedral meshing. The input is a bounding rectilinear domain with a set of embedded 2-manifold boundaries of arbitrary genus and topology. The algorithm first constructs a simplified Voronoi structure to partition the object into individual components that can be then meshed separately. We create a coarse hexahedral mesh for each Voronoi cell giving us an initial hexahedral scaffold. Recursive hexahedral subdivision of this hexahedral scaffold yields adaptive meshes. Splitting and Smoothing the boundary cells makes the mesh conform to the input 2-manifolds. Our choice of smoothing rules makes the resulting boundary surface of the hexahedral mesh as C2 continuous in the limit (C1 at extra-ordinary points), while also keeping a definite bound on the condition number of the Jacobian of the hexahedral mesh elements. By modifying the crease smoothing rules, we can also guarantee that the sharp features in the data are captured. Subdivision guarantees that we achieve a very good approximation for a given tolerance, with optimal mesh elements for each Level of Detail (LoD).