Variational mesh decomposition

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 Mumfo...

Full description

Saved in:
Bibliographic Details
Main Authors: Zhang, Juyong, Zheng, Jianmin, Wu, Chunlin, Cai, Jianfei
Other Authors: School of Computer Engineering
Format: Article
Language:English
Published: 2013
Subjects:
Online Access:https://hdl.handle.net/10356/98038
http://hdl.handle.net/10220/12254
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-98038
record_format dspace
spelling sg-ntu-dr.10356-980382020-05-28T07:41:40Z Variational mesh decomposition Zhang, Juyong Zheng, Jianmin Wu, Chunlin Cai, Jianfei School of Computer Engineering DRNTU::Engineering::Computer science and engineering 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. 2013-07-25T06:50:06Z 2019-12-06T19:49:55Z 2013-07-25T06:50:06Z 2019-12-06T19:49:55Z 2012 2012 Journal Article Zhang, J., Zheng, J., Wu, C., & Cai, J. (2012). Variational mesh decomposition. ACM Transactions on Graphics, 31(3). 0730-0301 https://hdl.handle.net/10356/98038 http://hdl.handle.net/10220/12254 10.1145/2167076.2167079 en ACM transactions on graphics © 2012 ACM.
institution Nanyang Technological University
building NTU Library
country Singapore
collection DR-NTU
language English
topic DRNTU::Engineering::Computer science and engineering
spellingShingle DRNTU::Engineering::Computer science and engineering
Zhang, Juyong
Zheng, Jianmin
Wu, Chunlin
Cai, Jianfei
Variational mesh decomposition
description 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.
author2 School of Computer Engineering
author_facet School of Computer Engineering
Zhang, Juyong
Zheng, Jianmin
Wu, Chunlin
Cai, Jianfei
format Article
author Zhang, Juyong
Zheng, Jianmin
Wu, Chunlin
Cai, Jianfei
author_sort Zhang, Juyong
title Variational mesh decomposition
title_short Variational mesh decomposition
title_full Variational mesh decomposition
title_fullStr Variational mesh decomposition
title_full_unstemmed Variational mesh decomposition
title_sort variational mesh decomposition
publishDate 2013
url https://hdl.handle.net/10356/98038
http://hdl.handle.net/10220/12254
_version_ 1681059633422139392