Using subgraph isomorphisms to recognize and decompose boundary representation features

S. H F Chuang, Mark Henderson

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

A method using subgraph isomorphisms is presented for both computer recognition of shape features and feature-based decomposition of a solid from a boundary representation (B-rep). Prior to the recognition process, the face-edge graph of an object is extracted from a B-rep and is labeled by shape elements as a shape graph, which is an abridged B-rep input to the recognition system. A feature is defined by a user as a feature graph, which is conceptualized from a regional surface shape on a valid solid. Feature recognition is achieved by finding a subgraph from the shape graph of a designed object where the subgraph is isomorphic to a feature graph. Because of the high complexity in subgraph matching, a node classification algorithm is used to reduce the search space. Through this recognition process, the surface of a solid can be decomposed into a collection of features according to a library of feature graphs. The feature relationships are represented in a relationship graph considering the features as nodes and their relationships as arcs. This research shows that the definition of features can be user-definable and consist of valid boundary representation elements in the solid world, and that a heuristically fast algorithm can increase the possibility to recognize features in a reasonable time.

Original languageEnglish (US)
Pages (from-to)793-800
Number of pages8
JournalJournal of Mechanical Design, Transactions of the ASME
Volume116
Issue number3
StatePublished - Sep 1994

Fingerprint

Decomposition

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Using subgraph isomorphisms to recognize and decompose boundary representation features. / Chuang, S. H F; Henderson, Mark.

In: Journal of Mechanical Design, Transactions of the ASME, Vol. 116, No. 3, 09.1994, p. 793-800.

Research output: Contribution to journalArticle

@article{3b4a2225cb4e4ac5a9924c341556b500,
title = "Using subgraph isomorphisms to recognize and decompose boundary representation features",
abstract = "A method using subgraph isomorphisms is presented for both computer recognition of shape features and feature-based decomposition of a solid from a boundary representation (B-rep). Prior to the recognition process, the face-edge graph of an object is extracted from a B-rep and is labeled by shape elements as a shape graph, which is an abridged B-rep input to the recognition system. A feature is defined by a user as a feature graph, which is conceptualized from a regional surface shape on a valid solid. Feature recognition is achieved by finding a subgraph from the shape graph of a designed object where the subgraph is isomorphic to a feature graph. Because of the high complexity in subgraph matching, a node classification algorithm is used to reduce the search space. Through this recognition process, the surface of a solid can be decomposed into a collection of features according to a library of feature graphs. The feature relationships are represented in a relationship graph considering the features as nodes and their relationships as arcs. This research shows that the definition of features can be user-definable and consist of valid boundary representation elements in the solid world, and that a heuristically fast algorithm can increase the possibility to recognize features in a reasonable time.",
author = "Chuang, {S. H F} and Mark Henderson",
year = "1994",
month = "9",
language = "English (US)",
volume = "116",
pages = "793--800",
journal = "Journal of Mechanical Design - Transactions of the ASME",
issn = "1050-0472",
publisher = "American Society of Mechanical Engineers(ASME)",
number = "3",

}

TY - JOUR

T1 - Using subgraph isomorphisms to recognize and decompose boundary representation features

AU - Chuang, S. H F

AU - Henderson, Mark

PY - 1994/9

Y1 - 1994/9

N2 - A method using subgraph isomorphisms is presented for both computer recognition of shape features and feature-based decomposition of a solid from a boundary representation (B-rep). Prior to the recognition process, the face-edge graph of an object is extracted from a B-rep and is labeled by shape elements as a shape graph, which is an abridged B-rep input to the recognition system. A feature is defined by a user as a feature graph, which is conceptualized from a regional surface shape on a valid solid. Feature recognition is achieved by finding a subgraph from the shape graph of a designed object where the subgraph is isomorphic to a feature graph. Because of the high complexity in subgraph matching, a node classification algorithm is used to reduce the search space. Through this recognition process, the surface of a solid can be decomposed into a collection of features according to a library of feature graphs. The feature relationships are represented in a relationship graph considering the features as nodes and their relationships as arcs. This research shows that the definition of features can be user-definable and consist of valid boundary representation elements in the solid world, and that a heuristically fast algorithm can increase the possibility to recognize features in a reasonable time.

AB - A method using subgraph isomorphisms is presented for both computer recognition of shape features and feature-based decomposition of a solid from a boundary representation (B-rep). Prior to the recognition process, the face-edge graph of an object is extracted from a B-rep and is labeled by shape elements as a shape graph, which is an abridged B-rep input to the recognition system. A feature is defined by a user as a feature graph, which is conceptualized from a regional surface shape on a valid solid. Feature recognition is achieved by finding a subgraph from the shape graph of a designed object where the subgraph is isomorphic to a feature graph. Because of the high complexity in subgraph matching, a node classification algorithm is used to reduce the search space. Through this recognition process, the surface of a solid can be decomposed into a collection of features according to a library of feature graphs. The feature relationships are represented in a relationship graph considering the features as nodes and their relationships as arcs. This research shows that the definition of features can be user-definable and consist of valid boundary representation elements in the solid world, and that a heuristically fast algorithm can increase the possibility to recognize features in a reasonable time.

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

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

M3 - Article

VL - 116

SP - 793

EP - 800

JO - Journal of Mechanical Design - Transactions of the ASME

JF - Journal of Mechanical Design - Transactions of the ASME

SN - 1050-0472

IS - 3

ER -