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

Prasad S. Gavankar, Mark Henderson

Research output: Contribution to journalArticle

10 Citations (Scopus)

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 triconnected 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
StatePublished - Dec 1995

Fingerprint

Feature extraction
Identification (control systems)

ASJC Scopus subject areas

  • Artificial Intelligence
  • Industrial and Manufacturing Engineering

Cite this

Graph-based extraction of two-connected morphological features from boundary representations. / Gavankar, Prasad S.; Henderson, Mark.

In: Journal of Intelligent Manufacturing, Vol. 6, No. 6, 12.1995, p. 401-413.

Research output: Contribution to journalArticle

@article{94670f95aa8f45ff899b53cd60d533d7,
title = "Graph-based extraction of two-connected morphological features from boundary representations",
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 triconnected 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.",
author = "Gavankar, {Prasad S.} and Mark Henderson",
year = "1995",
month = "12",
language = "English (US)",
volume = "6",
pages = "401--413",
journal = "Journal of Intelligent Manufacturing",
issn = "0956-5515",
publisher = "Springer Netherlands",
number = "6",

}

TY - JOUR

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

AU - Gavankar, Prasad S.

AU - Henderson, Mark

PY - 1995/12

Y1 - 1995/12

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

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

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

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

M3 - Article

VL - 6

SP - 401

EP - 413

JO - Journal of Intelligent Manufacturing

JF - Journal of Intelligent Manufacturing

SN - 0956-5515

IS - 6

ER -