Patch layout generation by detecting feature networks

Handle URI:
http://hdl.handle.net/10754/564029
Title:
Patch layout generation by detecting feature networks
Authors:
Cao, Yuanhao; Yan, Dongming ( 0000-0003-2209-2404 ) ; Wonka, Peter ( 0000-0003-0627-9746 )
Abstract:
The patch layout of 3D surfaces reveals the high-level geometric and topological structures. In this paper, we study the patch layout computation by detecting and enclosing feature loops on surfaces. We present a hybrid framework which combines several key ingredients, including feature detection, feature filtering, feature curve extension, patch subdivision and boundary smoothing. Our framework is able to compute patch layouts through concave features as previous approaches, but also able to generate nice layouts through smoothing regions. We demonstrate the effectiveness of our framework by comparing with the state-of-the-art methods.
KAUST Department:
Visual Computing Center (VCC); Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Computer Science Program
Publisher:
Elsevier BV
Journal:
Computers & Graphics
Issue Date:
Feb-2015
DOI:
10.1016/j.cag.2014.09.022
Type:
Article
ISSN:
00978493
Sponsors:
This work was funded by the MUST Visual Computing Center, Boeing company, the National Natural Science Foundation of China (61372168, 61331018, and 61271431), and the U.S. NSF.
Appears in Collections:
Articles; Computer Science Program; Visual Computing Center (VCC); Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorCao, Yuanhaoen
dc.contributor.authorYan, Dongmingen
dc.contributor.authorWonka, Peteren
dc.date.accessioned2015-08-03T12:29:02Zen
dc.date.available2015-08-03T12:29:02Zen
dc.date.issued2015-02en
dc.identifier.issn00978493en
dc.identifier.doi10.1016/j.cag.2014.09.022en
dc.identifier.urihttp://hdl.handle.net/10754/564029en
dc.description.abstractThe patch layout of 3D surfaces reveals the high-level geometric and topological structures. In this paper, we study the patch layout computation by detecting and enclosing feature loops on surfaces. We present a hybrid framework which combines several key ingredients, including feature detection, feature filtering, feature curve extension, patch subdivision and boundary smoothing. Our framework is able to compute patch layouts through concave features as previous approaches, but also able to generate nice layouts through smoothing regions. We demonstrate the effectiveness of our framework by comparing with the state-of-the-art methods.en
dc.description.sponsorshipThis work was funded by the MUST Visual Computing Center, Boeing company, the National Natural Science Foundation of China (61372168, 61331018, and 61271431), and the U.S. NSF.en
dc.publisherElsevier BVen
dc.subjectCurve networken
dc.subjectFittingen
dc.subjectPatch layouten
dc.subjectSegmentationen
dc.titlePatch layout generation by detecting feature networksen
dc.typeArticleen
dc.contributor.departmentVisual Computing Center (VCC)en
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentComputer Science Programen
dc.identifier.journalComputers & Graphicsen
dc.contributor.institutionNLPR-LIAMA, Institute of Automation, Chinese Academy of Sciences, Chinaen
dc.contributor.institutionDepartment of Computer Science and Engineering, Arizona State University, United Statesen
kaust.authorCao, Yuanhaoen
kaust.authorYan, Dongmingen
kaust.authorWonka, Peteren
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.