{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T00:58:30Z","timestamp":1777424310041,"version":"3.51.4"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2012,5,31]],"date-time":"2012-05-31T00:00:00Z","timestamp":1338422400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["MOE2008-T2-1-075"],"award-info":[{"award-number":["MOE2008-T2-1-075"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2012,5,31]]},"abstract":"<jats:p>The problem of decomposing a 3D mesh into meaningful segments (or parts) is of great practical importance in computer graphics. This article presents a variational mesh decomposition algorithm that can efficiently partition a mesh into a prescribed number of segments. The algorithm extends the Mumford-Shah model to 3D meshes that contains a data term measuring the variation within a segment using eigenvectors of a dual Laplacian matrix whose weights are related to the dihedral angle between adjacent triangles and a regularization term measuring the length of the boundary between segments. Such a formulation simultaneously handles segmentation and boundary smoothing, which are usually two separate processes in most previous work. The efficiency is achieved by solving the Mumford-Shah model through a saddle-point problem that is solved by a fast primal-dual method. A preprocess step is also proposed to determine the number of segments that the mesh should be decomposed into. By incorporating this preprocessing step, the proposed algorithm can automatically segment a mesh into meaningful parts. Furthermore, user interaction is allowed by incorporating the user's inputs into the variational model to reflect the user's special intention. Experimental results show that the proposed algorithm outperforms competitive segmentation methods when evaluated on the Princeton Segmentation Benchmark.<\/jats:p>","DOI":"10.1145\/2167076.2167079","type":"journal-article","created":{"date-parts":[[2012,6,5]],"date-time":"2012-06-05T17:34:28Z","timestamp":1338917668000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":71,"title":["Variational mesh decomposition"],"prefix":"10.1145","volume":"31","author":[{"given":"Juyong","family":"Zhang","sequence":"first","affiliation":[{"name":"Nanyang Technological University, Singapore"}]},{"given":"Jianmin","family":"Zheng","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore"}]},{"given":"Chunlin","family":"Wu","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}]},{"given":"Jianfei","family":"Cai","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2012,6,5]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SMI.2006.24"},{"key":"e_1_2_2_2_1","first-page":"274","article-title":"A fixed point formulation of the k-means algorithm and a connection to Mumford-Shah","volume":"9","author":"Bardsley J. M.","year":"2009","journal-title":"Appl. Math. E-Notes"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1531326.1531379"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015817"},{"key":"e_1_2_2_5_1","volume-title":"Proceedings of the International Conference on Computer Vision (ICCV).","author":"Delaunoy A."},{"key":"e_1_2_2_6_1","volume-title":"Proceedings of 8th International Workshop on Algorithms and Data Structures (WADS). 25--36","author":"Dey T. K."},{"key":"e_1_2_2_7_1","volume-title":"Proceedings of ACM\/SIAM Symposium on Discreate Algorithms (SODA). 650--663","author":"Dey T. K."},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015775"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1409060.1409098"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.233"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s003710050192"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.159993"},{"key":"e_1_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Hoffman D. and Singh M. 1997. Salience of visual parts. Cognition 29--78.  Hoffman D. and Singh M. 1997. Salience of visual parts. Cognition 29--78.","DOI":"10.1016\/S0010-0277(96)00791-3"},{"key":"e_1_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Hoffman D. D. and Richards W. 1984. Parts of recognition. Cognition 65--96.  Hoffman D. D. and Richards W. 1984. Parts of recognition. Cognition 65--96.","DOI":"10.1016\/0010-0277(84)90022-2"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1778765.1778839"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-005-0344-9"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882369"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1364901.1364927"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2005.04.002"},{"key":"e_1_2_2_20_1","unstructured":"Lellmann J. and Schn\u00f6rr C. 2011. Continuous multiclass labeling approaches and algorithms. CoRR abs\/1102.5448.  Lellmann J. and Schn\u00f6rr C. 2011. Continuous multiclass labeling approaches and algorithms. CoRR abs\/1102.5448."},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/566654.566590"},{"key":"e_1_2_2_22_1","doi-asserted-by":"crossref","unstructured":"L\u00e9vy B. and Zhang R. H. 2010. Spectral geometry processing. In ACM SIGGRAPH Course Notes.  L\u00e9vy B. and Zhang R. H. 2010. Spectral geometry processing. In ACM SIGGRAPH Course Notes.","DOI":"10.1145\/1837101.1837109"},{"key":"e_1_2_2_23_1","volume-title":"Proceedings of the Pacific Conference on Computer Graphics and Applications. 298--305","author":"Liu R."},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2007.01061.x"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.3160420503"},{"key":"e_1_2_2_26_1","volume-title":"Proceedings of the Conference on Neural Information Processing Systems (NIPS). 849--856","author":"Ng A. Y."},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/040615286"},{"key":"e_1_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Pock T. Chambolle A. Cremers D. and Bischof H. 2009a. A convex relaxation approach for computing minimal partitions. In Computer Vision and Pattern Recognition 810--817.  Pock T. Chambolle A. Cremers D. and Bischof H. 2009a. A convex relaxation approach for computing minimal partitions. In Computer Vision and Pattern Recognition 810--817.","DOI":"10.1109\/CVPR.2009.5206604"},{"key":"e_1_2_2_29_1","volume-title":"Proceedings of the IEEE International Conference on Computer Vision (ICCV).","author":"Pock T."},{"key":"e_1_2_2_30_1","volume-title":"Proceedings of the Conference on Neural Information Processing Systems (NIPS). 1255--1262","author":"Polito M."},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01141092"},{"key":"e_1_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Rockafellar R. T. 1970. Convex Analysis. Princeton University Press.  Rockafellar R. T. 1970. Convex Analysis. Princeton University Press.","DOI":"10.1515\/9781400873173"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2007.01103.x"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-006-0370-2"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-007-0197-5"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-8659.00581"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020874308076"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/080722758"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/SMI.2005.21"},{"key":"e_1_2_2_41_1","volume-title":"Proceedings of the Conference on Neural Information Processing Systems (NIPS).","author":"Zelnik-Manor L."},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2009.01621.x"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2167076.2167079","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2167076.2167079","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:00:32Z","timestamp":1750276832000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2167076.2167079"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,31]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,5,31]]}},"alternative-id":["10.1145\/2167076.2167079"],"URL":"https:\/\/doi.org\/10.1145\/2167076.2167079","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,31]]},"assertion":[{"value":"2011-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}