Robust algorithms for generating quilts and chains

John F. Dannenhoffer, Robert Haimes

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Since their introduction several years ago, quilts and chains have gained increasing popularity as a means for converting a CAD-system-generated boundary representation of faces into an engineering representation that properly group faces based largely upon the engineering intent. The algorithms used to define, create, and evaluate quilts and chains have undergone many revisions during the last several years. Contained herein is the current description of the algorithms that have proved effective at representing over 50 real-world configurations.

Original languageEnglish (US)
Title of host publicationCollection of Technical Papers - 44th AIAA Aerospace Sciences Meeting
Pages11287-11293
Number of pages7
StatePublished - Dec 1 2006
Event44th AIAA Aerospace Sciences Meeting 2006 - Reno, NV, United States
Duration: Jan 9 2006Jan 12 2006

Publication series

NameCollection of Technical Papers - 44th AIAA Aerospace Sciences Meeting
Volume15

Other

Other44th AIAA Aerospace Sciences Meeting 2006
CountryUnited States
CityReno, NV
Period1/9/061/12/06

ASJC Scopus subject areas

  • Space and Planetary Science
  • Aerospace Engineering

Fingerprint Dive into the research topics of 'Robust algorithms for generating quilts and chains'. Together they form a unique fingerprint.

  • Cite this

    Dannenhoffer, J. F., & Haimes, R. (2006). Robust algorithms for generating quilts and chains. In Collection of Technical Papers - 44th AIAA Aerospace Sciences Meeting (pp. 11287-11293). (Collection of Technical Papers - 44th AIAA Aerospace Sciences Meeting; Vol. 15).