Duplicate-skins for compatible mesh modelling

Yu Wang*, Charlie C.L. Wang, Matthew M.F. Yuen

*Corresponding author for this work

Research output: Chapter in Book/Conference proceedingConference contributionpeer-review

Abstract

As compatible meshes play important roles in many computer-aided design applications, we present a new approach for modelling compatible meshes. Our compatible mesh modelling method is derived from the skin algorithm [Markosian et al. 1999] which conducts an active particle-based mesh surface to approximate the given models serving as skeletons. To construct compatible meshes, we developed a duplicate-skins algorithm to simultaneously grow two skins with identical connectivity over two skeleton models; therefore, the resultant skin meshes are compatible. Our duplicate-skins algorithm has less topological constraints on the input models: multiple polygonal models, models with ill-topology meshes, or even point clouds could all be employed as skeletons to model compatible meshes. Based on the results of our duplicate-skins algorithm, the modelling method of n-Ary compatible meshes is also developed in this paper.

Original languageEnglish
Title of host publicationProceedings SPM 2006 - ACM Symposium on Solid and Physical Modeling
PublisherAssociation for Computing Machinery
Pages207-218
Number of pages12
ISBN (Print)1595933581, 9781595933584
DOIs
Publication statusPublished - 1 Jan 2006
EventSPM 2006 - ACM Symposium on Solid and Physical Modeling - Wales, United Kingdom
Duration: 6 Jun 20058 Jun 2005

Publication series

NameProceedings SPM 2006 - ACM Symposium on Solid and Physical Modeling
Volume2006

Conference

ConferenceSPM 2006 - ACM Symposium on Solid and Physical Modeling
Country/TerritoryUnited Kingdom
CityWales
Period6/06/058/06/05

Keywords

  • Compatible meshes
  • Deformation
  • Design automation
  • Free-form modelling
  • Skin algorithm

Fingerprint

Dive into the research topics of 'Duplicate-skins for compatible mesh modelling'. Together they form a unique fingerprint.

Cite this