Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th 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
Adaptive and quality 3D meshing from imaging data
SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Variational tetrahedral meshing
ACM SIGGRAPH 2005 Papers
Convergence of the Lloyd Algorithm for Computing Centroidal Voronoi Tessellations
SIAM Journal on Numerical Analysis
Geometric modeling based on triangle meshes
ACM SIGGRAPH 2006 Courses
Isosurface stuffing: fast tetrahedral meshes with good dihedral angles
ACM SIGGRAPH 2007 papers
Constraint-based fairing of surface meshes
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
2D Euclidean distance transform algorithms: A comparative survey
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
In this paper, a variational tetrahedral meshing approach is used to adapt a tetrahedral mesh to the underlying CT volumetric data so that image edges are well approximated in the mesh. Afterwards, tetrahedra in the mesh are classified into regions whose image characteristics are similar. Three different clustering schemes are proposed to classify tetrahedra, while the clustering scheme viewing the mesh as an undirected graph achieved best results.