{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T12:39:46Z","timestamp":1753879186801,"version":"3.41.2"},"reference-count":22,"publisher":"ASME International","issue":"1","content-domain":{"domain":["asmedigitalcollection.asme.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,3,1]]},"abstract":"<jats:p>Mesh generation from X-ray computed tomography (CT) images of mechanical parts is an important consideration in industrial application, and boundary surface meshes in multimaterial parts can be extracted by generating segmented meshes from segmented images. In this paper, the authors outline a new approach for achieving segmented mesh generation. The image is first subjected to centroidal Voronoi tessellation and Delaunay tessellation steered by a density map to create a triangular mesh while maintaining discontinuities between materials. Given an input domain and a number of initial sites, the energy function is minimized automatically by iteratively updating the Voronoi tessellation and relocating sites to produce optimized domain discretization and form the mesh. Thus, the mesh in question is effectively and quickly segmented into different parts via this new graph cut method. The proposed approach is considered more efficient because there are fewer triangles than pixels, which reduces computation time and memory usage.<\/jats:p>","DOI":"10.1115\/1.4026292","type":"journal-article","created":{"date-parts":[[2013,12,20]],"date-time":"2013-12-20T17:30:58Z","timestamp":1387560658000},"update-policy":"https:\/\/doi.org\/10.1115\/crossmarkpolicy-asme","source":"Crossref","is-referenced-by-count":1,"title":["Generation of Segmented Triangular Meshes From CT Images Based on Centroidal Voronoi Tessellation and the Graph Cut Method"],"prefix":"10.1115","volume":"14","author":[{"given":"Caiyun","family":"Yang","sequence":"first","affiliation":[{"name":"Institute of Automation, Chinese Academy of Sciences, Beijing 100864, China e-mail:"}]},{"given":"Yutaka","family":"Ohtake","sequence":"additional","affiliation":[{"name":"RCAST (Research Center for Advanced Science and Technology), The University of Tokyo, Tokyo 13-8654, Japan e-mail:"}]},{"given":"Masaki","family":"Moriguchi","sequence":"additional","affiliation":[{"name":"Computer Science, Chuo University, Tokyo 112-0003, Japan e-mail:"}]},{"given":"Hiromasa","family":"Suzuki","sequence":"additional","affiliation":[{"name":"RCAST (Research Center for Advanced Science and Technology), The University of Tokyo, Tokyo 13-8654, Japan e-mail:"}]}],"member":"33","published-online":{"date-parts":[[2014,1,29]]},"reference":[{"issue":"2","key":"2019100603524338000_B1","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1016\/j.cirp.2011.05.006","article-title":"Computed Tomography for Dimensional Metrology","volume":"60","year":"2011","journal-title":"CIRP Ann."},{"issue":"1","key":"2019100603524338000_B2","first-page":"603","article-title":"Creeping Contours: A Multilabel Image Segmentation Method for Extracting Boundary Surfaces of Parts in Volumetric Images","volume":"11","year":"2011","journal-title":"ASME J. Comput. Information Science in Engineering"},{"issue":"2","key":"2019100603524338000_B3","first-page":"119","article-title":"Advances in Studies and Applications of Centroidal Voronoi Tessellations","volume":"3","year":"2010","journal-title":"Numerical Mathematics: Theory, Methods and Applications"},{"issue":"9","key":"2019100603524338000_B4","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.1109\/TPAMI.2004.60","article-title":"An Experimental Comparison of Min-Cut\/Max-Flow Algorithms for Energy Minimization in Vision","volume":"26","year":"2004","journal-title":"IEEE Tran. on Pattern Analysis and MachineInterlligence"},{"issue":"9","key":"2019100603524338000_B5","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1002\/nme.616","article-title":"Tetrahedral Mesh Generation and Optimization Based on Centroidal Voronoi Tessellations","volume":"56","year":"2003","journal-title":"International Journal for Numerical Methods in Engineering"},{"issue":"2","key":"2019100603524338000_B6","first-page":"299","article-title":"Optimal Delaunay Triangulations","volume":"22","year":"2004","journal-title":"J. Comput. Math."},{"issue":"5","key":"2019100603524338000_B7","doi-asserted-by":"crossref","first-page":"1488","DOI":"10.1137\/S1064827501391576","article-title":"Constrained Centroidal Voronoi Tesselations for Surfaces","volume":"24","year":"2003","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"2019100603524338000_B8","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1137\/S1064827503428527","article-title":"Anisotropic Centroidal Voronoi Tessellations and Their Applications","volume":"26","year":"2005","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"2019100603524338000_B9","first-page":"381","article-title":"Approximated Centroidal Voronoi Diagrams for Uniform Polygonal Mesh Coarsening","volume":"23","year":"2004","journal-title":"Computer Graphics Forum (Eurographics 2004 proceedings)"},{"year":"1989","key":"2019100603524338000_B10","article-title":"Guaranteed-Quality Triangular Meshes"},{"key":"2019100603524338000_B11","doi-asserted-by":"crossref","unstructured":"Ruppert, J., 1993, \u201cA Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation,\u201d The fourth annual ACM SIAM symposium on Discrete algorithms, pp. 548\u2013585.","DOI":"10.1006\/jagm.1995.1021"},{"key":"2019100603524338000_B12","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1137\/S0036144599352836","article-title":"Centroidal Voronoi Tessellations: Applications and Algorithms","volume":"41","year":"1999","journal-title":"SIAM Rev."},{"issue":"2\u20133","key":"2019100603524338000_B13","first-page":"591","article-title":"Grid Generation and Optimization Based on Centroidal Voronoi Tessellations","volume":"133","year":"2002","journal-title":"Appl. Math. Comput."},{"issue":"5","key":"2019100603524338000_B14","first-page":"401","article-title":"Variational Tetrahedral Mesh Generation From Discrete Volume Data","volume":"25","year":"2009","journal-title":"Visual Comput."},{"key":"2019100603524338000_B15","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/j.cma.2009.06.007","article-title":"An Automatic 3D Mesh Generation Method for Domains With Multiple Materials","volume":"199","year":"2010","journal-title":"Comput. Methods Appl. Mech. Engrg."},{"key":"2019100603524338000_B16","unstructured":"Veksler, O., 1999, \u201cEfficient Graph-Based Energy Minization Methods in Computer Vision,\u201d Ph.D thesis."},{"issue":"3","key":"2019100603524338000_B17","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1145\/1015706.1015719","article-title":"Lazy Snapping","volume":"23","year":"2004","journal-title":"ACM Trans. Graphics"},{"key":"2019100603524338000_B18","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/0-387-28831-7_5","article-title":"Graph Cuts in Vision and Graphics Theories and Applications","volume-title":"Handbook of Mathematical Models in Computer Vision","year":"2006"},{"key":"2019100603524338000_B19","doi-asserted-by":"crossref","unstructured":"Boykov, Y. Y., and Jolly, M. P., 2001, \u201cInteractive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in N-D Images,\u201d Eighth IEEE International Conference on Computer Vision 1, pp. 105\u2013112.","DOI":"10.1109\/ICCV.2001.937505"},{"issue":"3","key":"2019100603524338000_B20","doi-asserted-by":"crossref","first-page":"421","DOI":"10.3722\/cadaps.2011.421-433","article-title":"Sealed Decomposition of a Triangular Mesh With Tetrahedral Mesh Segmentation","volume":"8","year":"2011","journal-title":"International Journal of Computer-Aided Design and Applications"},{"key":"2019100603524338000_B21","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1080\/01621459.1963.10500845","article-title":"Hierarchical Grouping to Optimize an Objective Function","volume":"58","year":"1963","journal-title":"Journal of the American Statistical Association"},{"key":"2019100603524338000_B22","unstructured":"Fabri, A., 2001, \u201cCGAL\u2014The Computational Geometry Algorithm Library,\u201d Proceedings of 10th International Meshing Roundtable, pp. 137\u2013142."}],"container-title":["Journal of Computing and Information Science in Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/asmedigitalcollection.asme.org\/computingengineering\/article-pdf\/doi\/10.1115\/1.4026292\/6099383\/jcise_014_01_011009.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/asmedigitalcollection.asme.org\/computingengineering\/article-pdf\/doi\/10.1115\/1.4026292\/6099383\/jcise_014_01_011009.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T08:22:17Z","timestamp":1746087737000},"score":1,"resource":{"primary":{"URL":"https:\/\/asmedigitalcollection.asme.org\/computingengineering\/article\/doi\/10.1115\/1.4026292\/370112\/Generation-of-Segmented-Triangular-Meshes-From-CT"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,29]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,3,1]]}},"URL":"https:\/\/doi.org\/10.1115\/1.4026292","relation":{},"ISSN":["1530-9827","1944-7078"],"issn-type":[{"type":"print","value":"1530-9827"},{"type":"electronic","value":"1944-7078"}],"subject":[],"published":{"date-parts":[[2014,1,29]]},"article-number":"011009"}}