SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Guaranteed-quality Delaunay meshing in 3D (short version)
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Journal of the ACM (JACM)
Generating well-shaped Delaunay meshed in 3D
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
IEEE Transactions on Visualization and Computer Graphics
A Developer's Survey of Polygonal Simplification Algorithms
IEEE Computer Graphics and Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence
Mesh Simplification with Hierarchical Shape Analysis and Iterative Edge Contraction
IEEE Transactions on Visualization and Computer Graphics
Isosurface stuffing: fast tetrahedral meshes with good dihedral angles
ACM SIGGRAPH 2007 papers
Mesh Generation from 3D Multi-material Images
MICCAI '09 Proceedings of the 12th International Conference on Medical Image Computing and Computer-Assisted Intervention: Part II
High-quality consistent meshing of multi-label datasets
IPMI'07 Proceedings of the 20th international conference on Information processing in medical imaging
High quality real-time image-to-mesh conversion for finite element simulations
Proceedings of the 27th international ACM conference on International conference on supercomputing
High quality real-time Image-to-Mesh conversion for finite element simulations
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
We present a novel algorithm for tetrahedral image-to-mesh conversion which allows for guaranteed bounds on the smallest dihedral angle and on the distance between the boundaries of the mesh and the boundaries of the tissues. The algorithm produces a small number of mesh elements that comply with these bounds. We also describe and evaluate our implementation of the proposed algorithm that is compatible in performance with a state-of-the art Delaunay code, but in addition solves the small dihedral angle problem.