Patch layout generation by detecting feature networks

Yuanhao Cao; Dongming Yan; Peter Wonka

doi:10.1016/j.cag.2014.09.022

Patch layout generation by detecting feature networks

Yuanhao Cao, Dongming Yan, Peter Wonka

Research output: Contribution to journal › Article › peer-review

12 Scopus citations

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.

Original language	English (US)
Pages (from-to)	275-282
Number of pages	8
Journal	Computers & Graphics
Volume	46
DOIs	https://doi.org/10.1016/j.cag.2014.09.022
State	Published - Feb 2015

Bibliographical note

KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: 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.

ASJC Scopus subject areas

Computer Graphics and Computer-Aided Design
General Engineering
Human-Computer Interaction

Access to Document

10.1016/j.cag.2014.09.022

Cite this

@article{e2709125cc1e4520b24404e223248f8b,

title = "Patch layout generation by detecting feature networks",

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.",

author = "Yuanhao Cao and Dongming Yan and Peter Wonka",

note = "KAUST Repository Item: Exported on 2020-10-01 Acknowledgements: 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.",

year = "2015",

month = feb,

doi = "10.1016/j.cag.2014.09.022",

language = "English (US)",

volume = "46",

pages = "275--282",

journal = "Computers & Graphics",

issn = "0097-8493",

publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Patch layout generation by detecting feature networks

AU - Cao, Yuanhao

AU - Yan, Dongming

AU - Wonka, Peter

N1 - KAUST Repository Item: Exported on 2020-10-01 Acknowledgements: 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.

PY - 2015/2

Y1 - 2015/2

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

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

UR - http://hdl.handle.net/10754/564029

UR - https://linkinghub.elsevier.com/retrieve/pii/S0097849314001101

UR - http://www.scopus.com/inward/record.url?scp=84909592722&partnerID=8YFLogxK

U2 - 10.1016/j.cag.2014.09.022

DO - 10.1016/j.cag.2014.09.022

M3 - Article

SN - 0097-8493

VL - 46

SP - 275

EP - 282

JO - Computers & Graphics

JF - Computers & Graphics

ER -

Patch layout generation by detecting feature networks

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this