Patch layout generation by detecting feature networks

Yuanhao Cao, Dong Ming Yan, Peter Wonka

Research output: Contribution to journalArticle

4 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)275-282
Number of pages8
JournalComputers and Graphics (Pergamon)
Volume46
DOIs
StatePublished - 2014

Keywords

  • Curve network
  • Fitting
  • Patch layout
  • Segmentation

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Human-Computer Interaction
  • Engineering(all)

Cite this

Patch layout generation by detecting feature networks. / Cao, Yuanhao; Yan, Dong Ming; Wonka, Peter.

In: Computers and Graphics (Pergamon), Vol. 46, 2014, p. 275-282.

Research output: Contribution to journalArticle

Cao, Yuanhao ; Yan, Dong Ming ; Wonka, Peter. / Patch layout generation by detecting feature networks. In: Computers and Graphics (Pergamon). 2014 ; Vol. 46. pp. 275-282.
@article{236846210fa945099e01d99281e68cb7,
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.",
keywords = "Curve network, Fitting, Patch layout, Segmentation",
author = "Yuanhao Cao and Yan, {Dong Ming} and Peter Wonka",
year = "2014",
doi = "10.1016/j.cag.2014.09.022",
language = "English (US)",
volume = "46",
pages = "275--282",
journal = "Computers and Graphics (Pergamon)",
issn = "0097-8493",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Patch layout generation by detecting feature networks

AU - Cao, Yuanhao

AU - Yan, Dong Ming

AU - Wonka, Peter

PY - 2014

Y1 - 2014

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.

KW - Curve network

KW - Fitting

KW - Patch layout

KW - Segmentation

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

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

U2 - 10.1016/j.cag.2014.09.022

DO - 10.1016/j.cag.2014.09.022

M3 - Article

AN - SCOPUS:84909592722

VL - 46

SP - 275

EP - 282

JO - Computers and Graphics (Pergamon)

JF - Computers and Graphics (Pergamon)

SN - 0097-8493

ER -