IEEE Transactions on Pattern Analysis and Machine Intelligence · 1989 · 119 citations · 10 references
ComputingComputer ScienceComputational GeometryComputer VisionFeature EngineeringFeature DescriptionFeature ExtractionObject RecognitionShape AnalysisShape RepresentationTopological Modeling3D Feature Extraction3D Shape AnalysisFace RepresentationForm FeaturesHierarchical Shape DecompositionShape Feature ExtractionShape RecognitionTopological Features
An algorithm for extracting certain classes of form features from a relational boundary model of an object, called the generalized edge-face graph (GEFG), is described. The GEFG provides a face-based topological description of the object boundary and encodes the minimum number of relations needed in the recognition process. The feature identification and classification are based on the analysis of the connectivity properties of the edge-face graph associated with the GEFG and on some geometric considerations. The result is a hierarchical graph decomposition of the object boundary into components representing form features.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
10
Depth-First Search and Linear Graph Algorithms
Robert E. Tarjan · SIAM Journal on Computing · 1972 · 6K citations
Dividing a Graph into Triconnected Components
John E. Hopcroft, Robert E. Tarjan · SIAM Journal on Computing · 1973 · 841 citations
Finding All the Elementary Circuits of a Directed Graph
D. Barton Johnson · SIAM Journal on Computing · 1975 · 828 citations
Topological Structures for Geometric Modeling
Kevin Weiler · 1986 · 248 citations