Graph-based extraction of two-connected morphological features from boundary representations

Prasad S. Gavankar, Mark Henderson

Research output: Contribution to journalArticlepeer-review

11 Scopus citations

Abstract

In this paper a feature extraction technique to isolate two-connected features from a boundary model is discussed. The technique involves identification of faces with multiple edge loops and faces sharing multiple edges as candidates for entrance faces of such features. It is observed that the two-connected features constitute tri connected components in the edge-face graphs of the boundary models. Heuristics are used to enhance an algorithm to decompose the edge-face graph of a boundary representation into its triconnected components. Pros and cons of this method are compared with the classic graph theoretic algorithm used to obtain triconnected components from a graph.

Original languageEnglish (US)
Pages (from-to)401-413
Number of pages13
JournalJournal of Intelligent Manufacturing
Volume6
Issue number6
DOIs
StatePublished - Dec 1995

Keywords

  • CAD
  • Morphological features
  • boundary representation
  • engineering design

ASJC Scopus subject areas

  • Software
  • Industrial and Manufacturing Engineering
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Graph-based extraction of two-connected morphological features from boundary representations'. Together they form a unique fingerprint.

Cite this