Elsevier

Computer-Aided Design

Volume 23, Issue 10, December 1991, Pages 658-668
Computer-Aided Design

Method for finding holes and pockets that connect multiple faces in 2 1/2D objects

https://doi.org/10.1016/0010-4485(91)90018-RGet rights and content

Abstract

Given a boundary representation, the problem of identifying sets of faces that bound holes and pockets in 2 1/2D objects is relatively trivial when they emanate from a single face, because the edges of the depression form an inner loop of convex edges.

There are, however, many components in which a hole or pocket is present, and yet defines no inner loop on any face; in other words, it has a nonunique entrance face. The paper describes an algorithm, based on the manipulation of a face—edge graph, for identifying sets of faces in a 2 1/2D object that bound holes or pockets with unique or nonunique entrance faces. The algorithm also determines the perimeter of the projected area enclosed by each hole or pocket in a specific direction. This information is of direct use in the manufacture of the component.

References (16)

  • J. Woodwark

    Some speculations on feature recognition

    Comput.-Aided Des.

    (1988)
  • B.K. Choi et al.

    Automatic recognition of machined surfaces from a 3D solid model

    Comput.-Aided Des.

    (1984)
  • GLUE3 User Manual Ferranti Infographics, Livingston, West Lothian,...
  • I. Donaldson

    The feature analysis system

  • T.C. Woo

    Feature extraction by volume decomposition

  • Y.C. Lee et al.

    Machine understanding of CSG: extraction and unification of manufacturing features

    IEEE Comput. Graph. & Applic.

    (1987)
  • L.K. Kyprianou

    Shape classification in computer aided design

  • M.R. Henderson

    Extraction of feature information from three dimensional CAD data

There are more references available in the full text version of this article.

Cited by (0)

View full text