Graph-based extraction of protrusions and depressions from boundary representations

P. Gavankar, Mark Henderson

Research output: Contribution to journalArticle

92 Citations (Scopus)

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 - 1990

Fingerprint

Boundary Representation
Face
Graph in graph theory
Feature extraction
Identification (control systems)
Feature Extraction
Heuristics
Decompose
Model

Keywords

  • boundary models
  • computer-aided design
  • feature extraction

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Industrial and Manufacturing Engineering
  • Geometry and Topology

Cite this

Graph-based extraction of protrusions and depressions from boundary representations. / Gavankar, P.; Henderson, Mark.

In: Computer-Aided Design, Vol. 22, No. 7, 1990, p. 442-450.

Research output: Contribution to journalArticle

Gavankar, P. ; Henderson, Mark. / Graph-based extraction of protrusions and depressions from boundary representations. In: Computer-Aided Design. 1990 ; Vol. 22, No. 7. pp. 442-450.
@article{7497977206d846af8d619a4bc1135ca6,
title = "Graph-based extraction of protrusions and depressions from boundary representations",
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.",
keywords = "boundary models, computer-aided design, feature extraction",
author = "P. Gavankar and Mark Henderson",
year = "1990",
doi = "10.1016/0010-4485(90)90109-P",
language = "English (US)",
volume = "22",
pages = "442--450",
journal = "CAD Computer Aided Design",
issn = "0010-4485",
publisher = "Elsevier Limited",
number = "7",

}

TY - JOUR

T1 - Graph-based extraction of protrusions and depressions from boundary representations

AU - Gavankar, P.

AU - Henderson, Mark

PY - 1990

Y1 - 1990

N2 - 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.

AB - 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.

KW - boundary models

KW - computer-aided design

KW - feature extraction

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

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

U2 - 10.1016/0010-4485(90)90109-P

DO - 10.1016/0010-4485(90)90109-P

M3 - Article

VL - 22

SP - 442

EP - 450

JO - CAD Computer Aided Design

JF - CAD Computer Aided Design

SN - 0010-4485

IS - 7

ER -