Building a feature-based object description from a boundary model

Computer-Aided Design

Volumn 21, Issue 10, 1989, Pages 602-610

  De Floriani, L ^a   Bruzzone, E ^a  

^a CNR   (Italy)

Author keywords

computer aided design; feature recognition; form features; modular boundary models; process planning

Indexed keywords

COMPUTER AIDED DESIGN; FEATURE RECOGNITION;

EID: 0024531845     PISSN: 00104485     EISSN: None     Source Type: Journal    
DOI: 10.1016/0010-4485(89)90158-9     Document Type: Article

References (31)

1. Three dimensional object recognition
2. Requirements for support of form features in a solid modeling system
3. A hierarchical boundary model for solid object representation
4. An alternative goal-oriented hierarchical representation of solid objects for computer integrated manufacturing
5. Representation of rigid solids theory methods and systems
6. Feature extraction by volume decomposition
7. Shape features in geometric modeling
8. Extraction of feature information from three dimensional CAD data
9. Machine understanding of CSG: extraction and unification of manufacturing features
10. Graph-based heuristics for recognition of machined features from a 3D solid model
11. A graph-based aproach to object feature recognition
12. Extraction and organization of form features into a structured boundary model
13. Topological structures for geometric modeling
14. A combinational analysis of boundary data structure schemata
15. Decomposing a solid object into elementary features
16. Geometric modeling of solid objects by using a face adjacency graph representation
17. Edge-based data structures for solid modeling in a curved surface environment
18. Creating volume models from edge-vertex graphs
19. Finding all the elementary circuits of a directed graph
20. Alternative definitions of faces in boundary representations of solid objects
21. The quadtree and related hierarchical data structures
22. **2 Algorithm for Determining Isomorphism of Planar Graphs
23. *log(V) algorithm for isomorphism of triconnected planar graphs
24. A simple and efficient algorithm for determining isomorphism of planar triply connected graphs
25. An efficient algorithm for graph isomorphism
26. Cospectral graphs and digraphs
27. A backtrack procedure for isomorphism of directed graphs
28. A new algorithm for graph isomorphism