Fitting Sharp Features with Loop Subdivision Surfaces
Abstract
Various methods have been proposed for fitting subdivision surfaces to different forms of shape data (e.g., dense meshes or point clouds), but none of these methods effectively deals with shapes with sharp features, that is, creases, darts and corners. We present an effective method for fitting a Loop subdivision surface to a dense triangle mesh with sharp features. Our contribution is a new exact evaluation scheme for the Loop subdivision with all types of sharp features, which enables us to compute a fitting Loop subdivision surface for shapes with sharp features in an optimization framework. With an initial control mesh obtained from simplifying the input dense mesh using QEM, our fitting algorithm employs an iterative method to solve a nonlinear least squares problem based on the squared distances from the input mesh vertices to the fitting subdivision surface. This optimization framework depends critically on the ability to express these distances as quadratic functions of control mesh vertices using our exact evaluation scheme near sharp features. Experimental results are presented to demonstrate the effectiveness of the method.
BibTeX
@article {10.1111:j.1467-8659.2008.01278.x,
journal = {Computer Graphics Forum},
title = {{Fitting Sharp Features with Loop Subdivision Surfaces}},
author = {Ling, Ruotian and Wang, Wenping and Yan, Dongming},
year = {2008},
publisher = {The Eurographics Association and Blackwell Publishing Ltd},
ISSN = {1467-8659},
DOI = {10.1111/j.1467-8659.2008.01278.x}
}
journal = {Computer Graphics Forum},
title = {{Fitting Sharp Features with Loop Subdivision Surfaces}},
author = {Ling, Ruotian and Wang, Wenping and Yan, Dongming},
year = {2008},
publisher = {The Eurographics Association and Blackwell Publishing Ltd},
ISSN = {1467-8659},
DOI = {10.1111/j.1467-8659.2008.01278.x}
}