Graph-based extraction of protrusions and depressions from boundary representations

P. Gavankar, Mark Henderson

Research output: Contribution to journalArticlepeer-review

102 Scopus citations

Abstract

A feature extraction technique to isolate protrusions and depressions from boundary models is discussed. The technique involves identification of faces with multiple edge loops as candidates for entrance faces of such features. It is observed that protrusions and depressions constitute biconnected 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 biconnected components. Advantages and disadvantages of this method are compared against the classic graph theoretic algorithm to obtain biconnected components from a graph.

Original languageEnglish (US)
Pages (from-to)442-450
Number of pages9
JournalComputer-Aided Design
Volume22
Issue number7
DOIs
StatePublished - Sep 1990

Keywords

  • boundary models
  • computer-aided design
  • feature extraction

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design
  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'Graph-based extraction of protrusions and depressions from boundary representations'. Together they form a unique fingerprint.

Cite this