Patch layout generation by detecting feature networks

Yuanhao Cao, Dongming Yan, Peter Wonka

Research output: Contribution to journalArticlepeer-review

12 Scopus citations


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 languageEnglish (US)
Pages (from-to)275-282
Number of pages8
JournalComputers & Graphics
StatePublished - 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


Dive into the research topics of 'Patch layout generation by detecting feature networks'. Together they form a unique fingerprint.

Cite this