Graph-based extraction of protrusions and depressions from boundary representations

P. Gavankar; Mark Henderson

doi:10.1016/0010-4485(90)90109-P

Graph-based extraction of protrusions and depressions from boundary representations

P. Gavankar, Mark Henderson

Mechanical and Aerospace Engineering

Research output: Contribution to journal › Article › peer-review

110 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 language	English (US)
Pages (from-to)	442-450
Number of pages	9
Journal	Computer-Aided Design
Volume	22
Issue number	7
DOIs	https://doi.org/10.1016/0010-4485(90)90109-P
State	Published - 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

Access to Document

10.1016/0010-4485(90)90109-P

Cite this

@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",

note = "Funding Information: The authors wish to thank the National Science Foundation for its support throughout this research under PresidentialY oung InvestigatorG rant 8658021.",

year = "1990",

month = sep,

doi = "10.1016/0010-4485(90)90109-P",

language = "English (US)",

volume = "22",

pages = "442--450",

journal = "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

N1 - Funding Information: The authors wish to thank the National Science Foundation for its support throughout this research under PresidentialY oung InvestigatorG rant 8658021.

PY - 1990/9

Y1 - 1990/9

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

AN - SCOPUS:0025489515

SN - 0010-4485

VL - 22

SP - 442

EP - 450

JO - Computer-Aided Design

JF - Computer-Aided Design

IS - 7

ER -

Graph-based extraction of protrusions and depressions from boundary representations

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this