Skip to main content
SpringerLink
Log in

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

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

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 tri connected 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Ansaldi, S., Floriani, L.D. and Falcidieno, B. (1985) An edge-face relational scheme for boundary representations. Computer Graphics Forum, 4, 319–332.

    Google Scholar 

  • Choi, B.K., Barash, M.M. and Anderson, D.C. (1984) Automatic recognition of machined surfaces from a 3D solid model. Computer-Aided Design, 16(2), 81–86.

    Google Scholar 

  • Floriani, L.D. (1986) Extraction of topological features from a surface-based model of a solid object, in Advances in Image Processing and Pattern Recognition, Elsevier/North-Holland, Amsterdam, pp. 40–44.

  • Floriani, L.D. (1988) Representation and extraction of shape features in a solid model, in The Theoretical Foundations of Computer Graphics and CAD, Springer, New York.

  • Floriani, L.D. and Falcidieno, B. (1988) A hierarchical boundary model for solid object representation. ACM Transactions on Graphics, 7(1), 42–60.

    Google Scholar 

  • Ganu, P. (1989) Graph-based extraction of one and two connected features, M.S. Thesis, Arizona State University, Tempe.

    Google Scholar 

  • Gavankar, P. (1990) Graph-based extraction of features and analysis of tolerances in assemblies, Ph.D. Thesis, Arizona State University, Tempe.

    Google Scholar 

  • Gavankar, P.S. (1993) Graph-based recognition of morphological features. Journal of Intelligent Manufacturing, 4, 209–218.

    Google Scholar 

  • Gavankar, P. and Henderson, M.R. (1990) Graph-based extraction of protrusions and depressions from boundary representations. Computer-Aided Design, 22(7), 442–449.

    Google Scholar 

  • Harary, F. (1972) Graph Theory, Addison-Wesley, Reading, MA.

    Google Scholar 

  • Henderson, M.R. and Anderson, D.C. (1984) Computer recognition and extraction of form features: a CAD/CAM link. Computers in Industry, 5, 329–339.

    Google Scholar 

  • Hopcroft, J. and Tarjan, R. (1972) Dividing a graph into triconnected components. SIAM Journal, 1, 146–159.

    Google Scholar 

  • Hopcroft, J. and Tarjan, R. (1973) Efficient algorithms for graph manipulations [H]. Communications of the ACM, June, 16(6), 372–378.

    Google Scholar 

  • Jakubowski, R. (1982) Syntactic characterization of machine parts shapes. Cybernetics and Systems, 13(1), 1–24.

    Google Scholar 

  • Joshi, S. (1987) CAD interface for automated process planning, Ph.D. thesis, Purdue University.

  • Joshi, S. and Chang, T.C. (1988) Graph-based heuristics for recognition of machined features from a 3D solid model. Computer-Aided Design, 20(2), 58–66.

    Google Scholar 

  • Kung, H. (1984) An investigation into development of process plans from solid geometric modeling representations, Ph.D. Thesis, Oklahoma State University.

  • Kyprianou, L.K. (1980) Shape classification in computer-aided design, Ph.D. Thesis, Christ's College, University of Cambridge.

  • Lee, Y.C. and Fu, K. (1987) Machine understanding of CSG: extraction and unification of manufacturing features. IEEE Computer Graphics and Applications, January, pp. 20–32.

  • Mortenson, M.E. (1985) Geometric Modeling, John Wiley and Sons, New York.

    Google Scholar 

  • Shah, J.J. (1991) Assessment of features technology. Computer-Aided Design, 23(5), 331–341.

    Google Scholar 

  • Staley, S.M., Anderson, D.C. and Henderson, M.R. (1983) Using syntactic pattern recognition to extract feature information from a solid geometric data base. Computers in Mechanical Engineering, 2(2), 61–66.

    Google Scholar 

  • Tarjan, R. (1972) Depth-first search and linear graph algorithms. SIAM Journal of Computing, 1(2), 146–160.

    Google Scholar 

  • Woo, T.C. (1975) Computer understanding of designs, Ph.D. Thesis, University of Illinois, Urbana.

    Google Scholar 

  • Woo, T.C. (1984) Interfacing solid modeling to CAD and CAM data structures and algorithms for decomposing a solid. Computer, 17(12), 44–49.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mechanical and Industrial Engineering, Texas A&M University-Kingsville, 78363, Kingsville, TX, USA

    Prasad S. Gavankar

  2. Department of Mechanical and Aerospace Engineering, Arizona State University, 85287, Tempe, AZ, USA

    Mark R. Henderson

Authors
  1. Prasad S. Gavankar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mark R. Henderson
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gavankar, P.S., Henderson, M.R. Graph-based extraction of two-connected morphological features from boundary representations. J Intell Manuf 6, 401–413 (1995). https://doi.org/10.1007/BF00124066

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00124066

Keywords

Search

Navigation