File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Fitting sharp features with loop subdivision surfaces

TitleFitting sharp features with loop subdivision surfaces
Authors
Issue Date2008
PublisherBlackwell Publishing Ltd. The Journal's web site is located at http://www.blackwellpublishing.com/journals/CGF
Citation
Computer Graphics Forum, 2008, v. 27 n. 5, p. 1383-1391 How to Cite?
AbstractVarious 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. © 2008 The Eurographics Association and Blackwell Publishing Ltd.
Persistent Identifierhttp://hdl.handle.net/10722/60627
ISSN
2015 Impact Factor: 1.542
2015 SCImago Journal Rankings: 0.960
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorLing, Ren_HK
dc.contributor.authorWang, Wen_HK
dc.contributor.authorYan, Den_HK
dc.date.accessioned2010-05-31T04:15:15Z-
dc.date.available2010-05-31T04:15:15Z-
dc.date.issued2008en_HK
dc.identifier.citationComputer Graphics Forum, 2008, v. 27 n. 5, p. 1383-1391en_HK
dc.identifier.issn0167-7055en_HK
dc.identifier.urihttp://hdl.handle.net/10722/60627-
dc.description.abstractVarious 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. © 2008 The Eurographics Association and Blackwell Publishing Ltd.en_HK
dc.languageengen_HK
dc.publisherBlackwell Publishing Ltd. The Journal's web site is located at http://www.blackwellpublishing.com/journals/CGFen_HK
dc.relation.ispartofComputer Graphics Forumen_HK
dc.titleFitting sharp features with loop subdivision surfacesen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0167-7055&volume=27&spage=1383&epage=1391&date=2008&atitle=Fitting+Sharp+Features+with+Loop+Subdivision+Surfacesen_HK
dc.identifier.emailWang, W:wenping@cs.hku.hken_HK
dc.identifier.authorityWang, W=rp00186en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1111/j.1467-8659.2008.01278.xen_HK
dc.identifier.scopuseid_2-s2.0-53149100140en_HK
dc.identifier.hkuros152730en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-53149100140&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume27en_HK
dc.identifier.issue5en_HK
dc.identifier.spage1383en_HK
dc.identifier.epage1391en_HK
dc.identifier.isiWOS:000258223700008-
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridLing, R=14058387100en_HK
dc.identifier.scopusauthoridWang, W=35147101600en_HK
dc.identifier.scopusauthoridYan, D=14825994000en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats